/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/eureka_01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:59:27,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:59:27,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:59:28,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:59:28,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:59:28,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:59:28,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:59:28,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:59:28,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:59:28,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:59:28,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:59:28,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:59:28,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:59:28,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:59:28,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:59:28,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:59:28,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:59:28,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:59:28,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:59:28,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:59:28,031 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:59:28,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:59:28,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:59:28,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:59:28,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:59:28,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:59:28,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:59:28,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:59:28,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:59:28,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:59:28,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:59:28,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:59:28,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:59:28,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:59:28,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:59:28,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:59:28,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:59:28,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:59:28,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:59:28,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:59:28,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:59:28,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:59:28,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 08:59:28,050 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:59:28,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:59:28,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:59:28,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:59:28,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:59:28,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:59:28,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:59:28,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:59:28,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:59:28,052 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:59:28,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:59:28,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:59:28,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:59:28,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:59:28,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:59:28,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:59:28,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:59:28,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:59:28,052 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:59:28,052 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:59:28,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:59:28,053 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 08:59:28,053 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:59:28,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:59:28,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:59:28,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:59:28,267 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:59:28,269 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:59:28,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01-2.c [2022-04-08 08:59:28,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee503273/a52df85b8470416ca6038e439b20d5e7/FLAGd265a0a52 [2022-04-08 08:59:28,710 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:59:28,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c [2022-04-08 08:59:28,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee503273/a52df85b8470416ca6038e439b20d5e7/FLAGd265a0a52 [2022-04-08 08:59:28,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee503273/a52df85b8470416ca6038e439b20d5e7 [2022-04-08 08:59:28,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:59:28,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:59:28,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:59:28,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:59:28,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:59:28,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:28" (1/1) ... [2022-04-08 08:59:28,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d1831b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:28, skipping insertion in model container [2022-04-08 08:59:28,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:28" (1/1) ... [2022-04-08 08:59:28,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:59:28,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:59:28,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c[323,336] [2022-04-08 08:59:28,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:59:28,955 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:59:28,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c[323,336] [2022-04-08 08:59:28,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:59:29,003 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:59:29,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29 WrapperNode [2022-04-08 08:59:29,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:59:29,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:59:29,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:59:29,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:59:29,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:59:29,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:59:29,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:59:29,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:59:29,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:59:29,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:29,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:59:29,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:59:29,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:59:29,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:59:29,137 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:59:29,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 08:59:29,137 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:59:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:59:29,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:59:29,184 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:59:29,185 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:59:29,391 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:59:29,395 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:59:29,395 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-08 08:59:29,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:29 BoogieIcfgContainer [2022-04-08 08:59:29,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:59:29,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:59:29,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:59:29,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:59:29,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:59:28" (1/3) ... [2022-04-08 08:59:29,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d8333d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:29, skipping insertion in model container [2022-04-08 08:59:29,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (2/3) ... [2022-04-08 08:59:29,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d8333d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:29, skipping insertion in model container [2022-04-08 08:59:29,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:29" (3/3) ... [2022-04-08 08:59:29,402 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2022-04-08 08:59:29,405 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:59:29,406 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:59:29,441 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:59:29,447 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:59:29,447 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:59:29,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:59:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 08:59:29,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:29,466 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:29,466 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:29,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1209894008, now seen corresponding path program 1 times [2022-04-08 08:59:29,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:29,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1918309993] [2022-04-08 08:59:29,486 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:59:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1209894008, now seen corresponding path program 2 times [2022-04-08 08:59:29,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:29,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398834897] [2022-04-08 08:59:29,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:29,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:29,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {38#true} is VALID [2022-04-08 08:59:29,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-08 08:59:29,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2022-04-08 08:59:29,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {43#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:29,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {38#true} is VALID [2022-04-08 08:59:29,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-08 08:59:29,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2022-04-08 08:59:29,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret22 := main(); {38#true} is VALID [2022-04-08 08:59:29,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {38#true} is VALID [2022-04-08 08:59:29,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2022-04-08 08:59:29,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-08 08:59:29,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-08 08:59:29,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-08 08:59:29,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-08 08:59:29,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-08 08:59:29,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {39#false} is VALID [2022-04-08 08:59:29,717 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {39#false} is VALID [2022-04-08 08:59:29,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-08 08:59:29,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-08 08:59:29,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-08 08:59:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:29,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:29,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398834897] [2022-04-08 08:59:29,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398834897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:29,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:29,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 08:59:29,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1918309993] [2022-04-08 08:59:29,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1918309993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:29,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:29,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 08:59:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086774652] [2022-04-08 08:59:29,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:29,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 08:59:29,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:29,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:29,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:29,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 08:59:29,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 08:59:29,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 08:59:29,781 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:29,901 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2022-04-08 08:59:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 08:59:29,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 08:59:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-04-08 08:59:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-04-08 08:59:29,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2022-04-08 08:59:30,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:30,022 INFO L225 Difference]: With dead ends: 61 [2022-04-08 08:59:30,022 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 08:59:30,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 08:59:30,026 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:30,027 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 43 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 08:59:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 08:59:30,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:30,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,048 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,048 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:30,051 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 08:59:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 08:59:30,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:30,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:30,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-08 08:59:30,052 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-08 08:59:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:30,055 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 08:59:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 08:59:30,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:30,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:30,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:30,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-08 08:59:30,060 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2022-04-08 08:59:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:30,061 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-08 08:59:30,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-08 08:59:30,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 08:59:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 08:59:30,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:30,112 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:30,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:59:30,112 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:30,113 INFO L85 PathProgramCache]: Analyzing trace with hash -286620772, now seen corresponding path program 1 times [2022-04-08 08:59:30,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:30,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [669988041] [2022-04-08 08:59:30,114 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:59:30,114 INFO L85 PathProgramCache]: Analyzing trace with hash -286620772, now seen corresponding path program 2 times [2022-04-08 08:59:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:30,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248717468] [2022-04-08 08:59:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:30,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {288#true} is VALID [2022-04-08 08:59:30,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-08 08:59:30,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {288#true} {288#true} #107#return; {288#true} is VALID [2022-04-08 08:59:30,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {294#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:30,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {288#true} is VALID [2022-04-08 08:59:30,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-08 08:59:30,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #107#return; {288#true} is VALID [2022-04-08 08:59:30,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret22 := main(); {288#true} is VALID [2022-04-08 08:59:30,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:30,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {289#false} is VALID [2022-04-08 08:59:30,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-08 08:59:30,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {289#false} assume !(~i~0 < ~nodecount~0); {289#false} is VALID [2022-04-08 08:59:30,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-08 08:59:30,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#false} assume !(~i~0 < ~edgecount~0); {289#false} is VALID [2022-04-08 08:59:30,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-08 08:59:30,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {289#false} is VALID [2022-04-08 08:59:30,235 INFO L272 TraceCheckUtils]: 13: Hoare triple {289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {289#false} is VALID [2022-04-08 08:59:30,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {289#false} ~cond := #in~cond; {289#false} is VALID [2022-04-08 08:59:30,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {289#false} assume 0 == ~cond; {289#false} is VALID [2022-04-08 08:59:30,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-08 08:59:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:30,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:30,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248717468] [2022-04-08 08:59:30,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248717468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:30,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:30,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:59:30,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:30,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [669988041] [2022-04-08 08:59:30,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [669988041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:30,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:30,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:59:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041560976] [2022-04-08 08:59:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:30,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 08:59:30,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:30,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:30,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:59:30,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:30,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:59:30,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:59:30,255 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:30,446 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-08 08:59:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:59:30,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 08:59:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-08 08:59:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-08 08:59:30,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2022-04-08 08:59:30,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:30,507 INFO L225 Difference]: With dead ends: 54 [2022-04-08 08:59:30,507 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 08:59:30,507 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:59:30,508 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:30,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 08:59:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-08 08:59:30,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:30,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,513 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,514 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:30,515 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-08 08:59:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-08 08:59:30,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:30,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:30,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-08 08:59:30,516 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-08 08:59:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:30,518 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-08 08:59:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-08 08:59:30,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:30,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:30,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:30,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-04-08 08:59:30,520 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2022-04-08 08:59:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:30,520 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-04-08 08:59:30,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 37 transitions. [2022-04-08 08:59:30,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:30,557 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-08 08:59:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:59:30,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:30,558 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:30,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:59:30,558 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash -344225220, now seen corresponding path program 1 times [2022-04-08 08:59:30,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:30,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1123047948] [2022-04-08 08:59:30,567 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:30,567 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash -344225220, now seen corresponding path program 2 times [2022-04-08 08:59:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:30,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991200480] [2022-04-08 08:59:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:30,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:30,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {535#true} is VALID [2022-04-08 08:59:30,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#true} assume true; {535#true} is VALID [2022-04-08 08:59:30,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {535#true} {535#true} #107#return; {535#true} is VALID [2022-04-08 08:59:30,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {535#true} call ULTIMATE.init(); {542#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:30,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {535#true} is VALID [2022-04-08 08:59:30,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {535#true} assume true; {535#true} is VALID [2022-04-08 08:59:30,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {535#true} {535#true} #107#return; {535#true} is VALID [2022-04-08 08:59:30,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {535#true} call #t~ret22 := main(); {535#true} is VALID [2022-04-08 08:59:30,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {535#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 08:59:30,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 08:59:30,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 08:59:30,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 08:59:30,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 08:59:30,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {541#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:30,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {536#false} is VALID [2022-04-08 08:59:30,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#false} ~i~0 := 0; {536#false} is VALID [2022-04-08 08:59:30,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#false} assume !(~i~0 < ~edgecount~0); {536#false} is VALID [2022-04-08 08:59:30,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {536#false} ~i~0 := 0; {536#false} is VALID [2022-04-08 08:59:30,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {536#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {536#false} is VALID [2022-04-08 08:59:30,660 INFO L272 TraceCheckUtils]: 16: Hoare triple {536#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {536#false} is VALID [2022-04-08 08:59:30,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#false} ~cond := #in~cond; {536#false} is VALID [2022-04-08 08:59:30,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {536#false} assume 0 == ~cond; {536#false} is VALID [2022-04-08 08:59:30,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {536#false} assume !false; {536#false} is VALID [2022-04-08 08:59:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 08:59:30,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:30,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991200480] [2022-04-08 08:59:30,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991200480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:30,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:30,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:30,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:30,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1123047948] [2022-04-08 08:59:30,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1123047948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:30,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:30,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56814392] [2022-04-08 08:59:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:59:30,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:30,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:30,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:59:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:59:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:59:30,681 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:30,891 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-08 08:59:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:59:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:59:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-08 08:59:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-08 08:59:30,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-08 08:59:30,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:30,964 INFO L225 Difference]: With dead ends: 61 [2022-04-08 08:59:30,964 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 08:59:30,965 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:59:30,967 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:30,971 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 29 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 08:59:30,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2022-04-08 08:59:30,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:30,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,981 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,981 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:30,983 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-08 08:59:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-08 08:59:30,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:30,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:30,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-04-08 08:59:30,984 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-04-08 08:59:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:30,986 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-08 08:59:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-08 08:59:30,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:30,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:30,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:30,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-08 08:59:30,988 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2022-04-08 08:59:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:30,988 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-08 08:59:30,989 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-08 08:59:31,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 08:59:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:59:31,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:31,026 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:31,026 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:59:31,031 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:31,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:31,031 INFO L85 PathProgramCache]: Analyzing trace with hash -522475142, now seen corresponding path program 1 times [2022-04-08 08:59:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:31,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [168795656] [2022-04-08 08:59:31,036 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:31,036 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash -522475142, now seen corresponding path program 2 times [2022-04-08 08:59:31,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:31,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372472783] [2022-04-08 08:59:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:31,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:31,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {834#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {827#true} is VALID [2022-04-08 08:59:31,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-08 08:59:31,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {827#true} {827#true} #107#return; {827#true} is VALID [2022-04-08 08:59:31,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {834#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:31,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {827#true} is VALID [2022-04-08 08:59:31,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-08 08:59:31,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #107#return; {827#true} is VALID [2022-04-08 08:59:31,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret22 := main(); {827#true} is VALID [2022-04-08 08:59:31,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {832#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {832#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {832#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {832#(<= 20 main_~edgecount~0)} ~i~0 := 0; {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {832#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {833#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:31,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {833#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {828#false} is VALID [2022-04-08 08:59:31,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {828#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {828#false} is VALID [2022-04-08 08:59:31,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {828#false} assume !(~i~0 < ~nodecount~0); {828#false} is VALID [2022-04-08 08:59:31,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#false} ~i~0 := 0; {828#false} is VALID [2022-04-08 08:59:31,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {828#false} assume !(~i~0 < ~edgecount~0); {828#false} is VALID [2022-04-08 08:59:31,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {828#false} ~i~0 := 0; {828#false} is VALID [2022-04-08 08:59:31,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {828#false} is VALID [2022-04-08 08:59:31,114 INFO L272 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {828#false} is VALID [2022-04-08 08:59:31,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2022-04-08 08:59:31,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0 == ~cond; {828#false} is VALID [2022-04-08 08:59:31,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2022-04-08 08:59:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 08:59:31,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:31,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372472783] [2022-04-08 08:59:31,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372472783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:31,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:31,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:31,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:31,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [168795656] [2022-04-08 08:59:31,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [168795656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:31,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:31,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791433382] [2022-04-08 08:59:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:31,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:59:31,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:31,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:31,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:59:31,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:31,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:59:31,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:59:31,133 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:31,293 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-08 08:59:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:59:31,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:59:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 08:59:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 08:59:31,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 08:59:31,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:31,359 INFO L225 Difference]: With dead ends: 55 [2022-04-08 08:59:31,359 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 08:59:31,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:59:31,360 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:31,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 08:59:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-08 08:59:31,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:31,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:31,376 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:31,377 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:31,378 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 08:59:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-08 08:59:31,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:31,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:31,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-08 08:59:31,379 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-08 08:59:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:31,380 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 08:59:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-08 08:59:31,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:31,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:31,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:31,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-08 08:59:31,382 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2022-04-08 08:59:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:31,382 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-08 08:59:31,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-08 08:59:31,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:31,416 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 08:59:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:59:31,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:31,417 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:31,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:59:31,418 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1086024003, now seen corresponding path program 1 times [2022-04-08 08:59:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:31,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [76924443] [2022-04-08 08:59:31,424 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:31,424 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1086024003, now seen corresponding path program 2 times [2022-04-08 08:59:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:31,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471440729] [2022-04-08 08:59:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:31,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:31,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {1094#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1087#true} is VALID [2022-04-08 08:59:31,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {1087#true} assume true; {1087#true} is VALID [2022-04-08 08:59:31,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1087#true} {1087#true} #107#return; {1087#true} is VALID [2022-04-08 08:59:31,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1094#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:31,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {1094#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1087#true} is VALID [2022-04-08 08:59:31,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {1087#true} assume true; {1087#true} is VALID [2022-04-08 08:59:31,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1087#true} {1087#true} #107#return; {1087#true} is VALID [2022-04-08 08:59:31,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {1087#true} call #t~ret22 := main(); {1087#true} is VALID [2022-04-08 08:59:31,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {1087#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {1092#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {1092#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {1092#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:31,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1093#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:31,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {1093#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {1088#false} is VALID [2022-04-08 08:59:31,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#false} ~i~0 := 0; {1088#false} is VALID [2022-04-08 08:59:31,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {1088#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1088#false} is VALID [2022-04-08 08:59:31,527 INFO L272 TraceCheckUtils]: 22: Hoare triple {1088#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1088#false} is VALID [2022-04-08 08:59:31,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {1088#false} ~cond := #in~cond; {1088#false} is VALID [2022-04-08 08:59:31,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {1088#false} assume 0 == ~cond; {1088#false} is VALID [2022-04-08 08:59:31,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2022-04-08 08:59:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:31,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:31,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471440729] [2022-04-08 08:59:31,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471440729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:31,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:31,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:31,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:31,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [76924443] [2022-04-08 08:59:31,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [76924443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:31,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:31,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:31,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284019489] [2022-04-08 08:59:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:59:31,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:31,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:31,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:59:31,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:31,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:59:31,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:59:31,549 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:31,750 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-08 08:59:31,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:59:31,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:59:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 08:59:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 08:59:31,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 08:59:31,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:31,812 INFO L225 Difference]: With dead ends: 58 [2022-04-08 08:59:31,812 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 08:59:31,813 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:59:31,813 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:31,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 29 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 08:59:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-04-08 08:59:31,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:31,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:31,830 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:31,830 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:31,832 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-08 08:59:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-08 08:59:31,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:31,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:31,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-08 08:59:31,833 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-08 08:59:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:31,834 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-08 08:59:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-08 08:59:31,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:31,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:31,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:31,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-08 08:59:31,836 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2022-04-08 08:59:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:31,836 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-08 08:59:31,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-08 08:59:31,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-08 08:59:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:59:31,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:31,871 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:31,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:59:31,871 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash -669976079, now seen corresponding path program 1 times [2022-04-08 08:59:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:31,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2105025255] [2022-04-08 08:59:31,875 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:31,875 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash -669976079, now seen corresponding path program 2 times [2022-04-08 08:59:31,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:31,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879048406] [2022-04-08 08:59:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:31,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:31,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {1386#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-08 08:59:31,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 08:59:31,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-08 08:59:31,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1386#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:31,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-08 08:59:31,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 08:59:31,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-08 08:59:31,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-08 08:59:31,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:31,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:31,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:31,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1385#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:31,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {1385#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-08 08:59:31,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 08:59:31,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {1380#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {1380#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#false} assume !(~j~0 < ~edgecount~0); {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {1380#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#false} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1380#false} is VALID [2022-04-08 08:59:31,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-08 08:59:31,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 08:59:31,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 08:59:31,992 INFO L272 TraceCheckUtils]: 25: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-08 08:59:31,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-08 08:59:31,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-08 08:59:31,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-08 08:59:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:31,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:31,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879048406] [2022-04-08 08:59:31,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879048406] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:31,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719113438] [2022-04-08 08:59:31,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:31,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:31,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:31,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:32,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 08:59:32,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:32,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:32,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 08:59:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:32,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:32,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-08 08:59:32,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-08 08:59:32,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 08:59:32,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-08 08:59:32,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-08 08:59:32,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {1405#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {1405#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {1405#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {1405#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {1405#(<= 5 main_~nodecount~0)} ~i~0 := 0; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:32,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:32,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:32,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:32,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:32,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:32,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1440#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:32,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-08 08:59:32,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 08:59:32,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 08:59:32,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1380#false} is VALID [2022-04-08 08:59:32,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1380#false} is VALID [2022-04-08 08:59:32,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-08 08:59:32,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 08:59:32,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 08:59:32,346 INFO L272 TraceCheckUtils]: 25: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-08 08:59:32,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-08 08:59:32,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-08 08:59:32,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-08 08:59:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:32,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:32,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-08 08:59:32,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-08 08:59:32,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-08 08:59:32,473 INFO L272 TraceCheckUtils]: 25: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-08 08:59:32,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 08:59:32,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 08:59:32,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-08 08:59:32,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1380#false} is VALID [2022-04-08 08:59:32,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1380#false} is VALID [2022-04-08 08:59:32,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 08:59:32,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 08:59:32,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {1510#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-08 08:59:32,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1510#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:32,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:32,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:32,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:32,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:32,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {1533#(< 1 main_~nodecount~0)} ~i~0 := 0; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:32,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {1533#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {1533#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {1533#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {1533#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:32,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-08 08:59:32,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-08 08:59:32,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 08:59:32,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-08 08:59:32,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-08 08:59:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:32,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719113438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:32,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:32,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-08 08:59:32,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:32,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2105025255] [2022-04-08 08:59:32,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2105025255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:32,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:32,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:32,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315735327] [2022-04-08 08:59:32,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:32,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:59:32,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:32,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:32,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:59:32,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:32,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:59:32,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:59:32,507 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:32,678 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-08 08:59:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:59:32,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:59:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-08 08:59:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-08 08:59:32,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-08 08:59:32,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:32,739 INFO L225 Difference]: With dead ends: 63 [2022-04-08 08:59:32,740 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 08:59:32,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-04-08 08:59:32,740 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:32,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 43 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 08:59:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-04-08 08:59:32,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:32,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:32,759 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:32,759 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:32,760 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-08 08:59:32,760 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-08 08:59:32,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:32,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:32,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-08 08:59:32,761 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-08 08:59:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:32,762 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-08 08:59:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-08 08:59:32,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:32,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:32,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:32,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-08 08:59:32,763 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 29 [2022-04-08 08:59:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:32,763 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-08 08:59:32,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-08 08:59:32,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-08 08:59:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:59:32,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:32,822 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:32,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:33,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-08 08:59:33,039 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1490218863, now seen corresponding path program 3 times [2022-04-08 08:59:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:33,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1361406089] [2022-04-08 08:59:33,043 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:33,043 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1490218863, now seen corresponding path program 4 times [2022-04-08 08:59:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:33,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244799783] [2022-04-08 08:59:33,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:33,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:33,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:33,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {1855#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1848#true} is VALID [2022-04-08 08:59:33,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-08 08:59:33,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-08 08:59:33,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {1848#true} call ULTIMATE.init(); {1855#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:33,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1848#true} is VALID [2022-04-08 08:59:33,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-08 08:59:33,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-08 08:59:33,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {1848#true} call #t~ret22 := main(); {1848#true} is VALID [2022-04-08 08:59:33,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {1848#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1853#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:33,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {1853#(and (= main_~source~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1853#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:33,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {1853#(and (= main_~source~0 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1853#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:33,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {1853#(and (= main_~source~0 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} is VALID [2022-04-08 08:59:33,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} is VALID [2022-04-08 08:59:33,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 08:59:33,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {1849#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1849#false} is VALID [2022-04-08 08:59:33,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-08 08:59:33,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 08:59:33,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1849#false} is VALID [2022-04-08 08:59:33,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {1849#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1849#false} is VALID [2022-04-08 08:59:33,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {1849#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1849#false} is VALID [2022-04-08 08:59:33,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {1849#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1849#false} is VALID [2022-04-08 08:59:33,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {1849#false} assume !(~j~0 < ~edgecount~0); {1849#false} is VALID [2022-04-08 08:59:33,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {1849#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1849#false} is VALID [2022-04-08 08:59:33,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-08 08:59:33,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 08:59:33,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {1849#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 08:59:33,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {1849#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1849#false} is VALID [2022-04-08 08:59:33,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {1849#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1849#false} is VALID [2022-04-08 08:59:33,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {1849#false} assume !(~i~0 < ~edgecount~0); {1849#false} is VALID [2022-04-08 08:59:33,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 08:59:33,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 08:59:33,112 INFO L272 TraceCheckUtils]: 28: Hoare triple {1849#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1849#false} is VALID [2022-04-08 08:59:33,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {1849#false} ~cond := #in~cond; {1849#false} is VALID [2022-04-08 08:59:33,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {1849#false} assume 0 == ~cond; {1849#false} is VALID [2022-04-08 08:59:33,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {1849#false} assume !false; {1849#false} is VALID [2022-04-08 08:59:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:33,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:33,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244799783] [2022-04-08 08:59:33,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244799783] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:33,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815649922] [2022-04-08 08:59:33,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:59:33,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:33,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:33,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:33,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 08:59:33,170 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:59:33,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:33,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 08:59:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:33,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:33,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {1848#true} call ULTIMATE.init(); {1848#true} is VALID [2022-04-08 08:59:33,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {1848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1848#true} is VALID [2022-04-08 08:59:33,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-08 08:59:33,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-08 08:59:33,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {1848#true} call #t~ret22 := main(); {1848#true} is VALID [2022-04-08 08:59:33,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {1848#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1848#true} is VALID [2022-04-08 08:59:33,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {1848#true} assume !!(~i~0 < ~nodecount~0); {1848#true} is VALID [2022-04-08 08:59:33,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {1848#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1880#(<= main_~source~0 main_~i~0)} is VALID [2022-04-08 08:59:33,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {1880#(<= main_~source~0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1884#(<= (+ main_~source~0 1) main_~i~0)} is VALID [2022-04-08 08:59:33,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {1884#(<= (+ main_~source~0 1) main_~i~0)} assume !!(~i~0 < ~nodecount~0); {1884#(<= (+ main_~source~0 1) main_~i~0)} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {1884#(<= (+ main_~source~0 1) main_~i~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {1849#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1849#false} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1849#false} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {1849#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1849#false} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {1849#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1849#false} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {1849#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1849#false} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {1849#false} assume !(~j~0 < ~edgecount~0); {1849#false} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {1849#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1849#false} is VALID [2022-04-08 08:59:33,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {1849#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {1849#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {1849#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {1849#false} assume !(~i~0 < ~edgecount~0); {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L272 TraceCheckUtils]: 28: Hoare triple {1849#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {1849#false} ~cond := #in~cond; {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {1849#false} assume 0 == ~cond; {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {1849#false} assume !false; {1849#false} is VALID [2022-04-08 08:59:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:33,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:59:33,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815649922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:33,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:59:33,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-08 08:59:33,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:33,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1361406089] [2022-04-08 08:59:33,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1361406089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:33,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:33,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:59:33,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357411738] [2022-04-08 08:59:33,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:33,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:59:33,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:33,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:33,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:33,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:59:33,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:59:33,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:59:33,289 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:33,383 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-08 08:59:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:59:33,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:59:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-08 08:59:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-08 08:59:33,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-08 08:59:33,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:33,428 INFO L225 Difference]: With dead ends: 65 [2022-04-08 08:59:33,428 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 08:59:33,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:59:33,429 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:33,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 08:59:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-08 08:59:33,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:33,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:33,464 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:33,464 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:33,465 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-08 08:59:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-08 08:59:33,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:33,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:33,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-08 08:59:33,466 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-08 08:59:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:33,467 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-08 08:59:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-08 08:59:33,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:33,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:33,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:33,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-08 08:59:33,468 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 32 [2022-04-08 08:59:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:33,468 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-08 08:59:33,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:33,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 43 transitions. [2022-04-08 08:59:33,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 08:59:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:59:33,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:33,513 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:33,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:33,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-08 08:59:33,721 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1271364145, now seen corresponding path program 1 times [2022-04-08 08:59:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:33,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2092157725] [2022-04-08 08:59:33,726 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:33,726 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:33,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1271364145, now seen corresponding path program 2 times [2022-04-08 08:59:33,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:33,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317283331] [2022-04-08 08:59:33,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:33,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:33,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:33,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {2241#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-08 08:59:33,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-08 08:59:33,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-08 08:59:33,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2241#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:33,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {2241#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-08 08:59:33,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-08 08:59:33,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-08 08:59:33,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-08 08:59:33,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {2233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:33,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:33,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:33,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:33,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0); {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:33,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:33,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2240#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 08:59:33,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {2240#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 08:59:33,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 08:59:33,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-08 08:59:33,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2234#false} is VALID [2022-04-08 08:59:33,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2234#false} is VALID [2022-04-08 08:59:33,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L272 TraceCheckUtils]: 28: Hoare triple {2234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-08 08:59:33,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-08 08:59:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:33,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:33,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317283331] [2022-04-08 08:59:33,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317283331] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:33,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386628985] [2022-04-08 08:59:33,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:33,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:33,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:33,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 08:59:33,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:33,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:33,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 08:59:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:33,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:34,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2233#true} is VALID [2022-04-08 08:59:34,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-08 08:59:34,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-08 08:59:34,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-08 08:59:34,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-08 08:59:34,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {2233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:34,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:34,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:34,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:34,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:34,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:34,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2280#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:34,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {2280#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 08:59:34,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 08:59:34,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-08 08:59:34,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2234#false} is VALID [2022-04-08 08:59:34,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2234#false} is VALID [2022-04-08 08:59:34,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2234#false} is VALID [2022-04-08 08:59:34,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 08:59:34,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2234#false} is VALID [2022-04-08 08:59:34,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 08:59:34,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 08:59:34,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 08:59:34,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2234#false} is VALID [2022-04-08 08:59:34,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2234#false} is VALID [2022-04-08 08:59:34,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 08:59:34,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 08:59:34,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 08:59:34,015 INFO L272 TraceCheckUtils]: 28: Hoare triple {2234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2234#false} is VALID [2022-04-08 08:59:34,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-08 08:59:34,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-08 08:59:34,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-08 08:59:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:34,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:34,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-08 08:59:34,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-08 08:59:34,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-08 08:59:34,131 INFO L272 TraceCheckUtils]: 28: Hoare triple {2234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2234#false} is VALID [2022-04-08 08:59:34,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 08:59:34,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 08:59:34,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 08:59:34,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {2398#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 08:59:34,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {2402#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2398#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 08:59:34,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {2402#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2402#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:34,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {2402#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2402#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:34,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {2412#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2402#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:34,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {2412#(< (+ main_~i~0 2) main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2412#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 08:59:34,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {2412#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2412#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 08:59:34,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {2233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2412#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 08:59:34,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-08 08:59:34,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-08 08:59:34,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-08 08:59:34,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-08 08:59:34,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2233#true} is VALID [2022-04-08 08:59:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:34,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386628985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:34,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:34,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-08 08:59:34,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:34,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2092157725] [2022-04-08 08:59:34,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2092157725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:34,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:34,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:59:34,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547044653] [2022-04-08 08:59:34,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:34,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:59:34,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:34,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:34,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:34,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:59:34,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:34,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:59:34,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:59:34,159 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:34,361 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-08 08:59:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:59:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:59:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 08:59:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 08:59:34,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-08 08:59:34,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:34,415 INFO L225 Difference]: With dead ends: 66 [2022-04-08 08:59:34,415 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 08:59:34,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=123, Unknown=0, NotChecked=0, Total=210 [2022-04-08 08:59:34,416 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:34,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 48 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 08:59:34,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-08 08:59:34,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:34,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:34,443 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:34,452 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:34,453 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-08 08:59:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 08:59:34,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:34,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:34,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-04-08 08:59:34,454 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-04-08 08:59:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:34,455 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-08 08:59:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 08:59:34,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:34,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:34,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:34,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-04-08 08:59:34,456 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2022-04-08 08:59:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:34,456 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-04-08 08:59:34,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:34,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 46 transitions. [2022-04-08 08:59:34,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-08 08:59:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 08:59:34,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:34,498 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:34,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:34,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:34,705 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:34,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1380320561, now seen corresponding path program 3 times [2022-04-08 08:59:34,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:34,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [910751568] [2022-04-08 08:59:34,711 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:34,711 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:34,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1380320561, now seen corresponding path program 4 times [2022-04-08 08:59:34,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:34,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254456780] [2022-04-08 08:59:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:34,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:34,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:34,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {2750#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-08 08:59:34,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-08 08:59:34,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-08 08:59:34,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2750#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:34,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {2750#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-08 08:59:34,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-08 08:59:34,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-08 08:59:34,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-08 08:59:34,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {2741#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:34,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:34,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:34,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:34,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0); {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:34,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:34,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 08:59:34,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0); {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 08:59:34,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 08:59:34,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2749#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {2749#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {2742#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {2742#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {2742#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {2742#false} assume !(~j~0 < ~edgecount~0); {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {2742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {2742#false} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {2742#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {2742#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2742#false} is VALID [2022-04-08 08:59:34,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {2742#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2742#false} is VALID [2022-04-08 08:59:34,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-08 08:59:34,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 08:59:34,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 08:59:34,820 INFO L272 TraceCheckUtils]: 31: Hoare triple {2742#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2742#false} is VALID [2022-04-08 08:59:34,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-08 08:59:34,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-08 08:59:34,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-08 08:59:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:34,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:34,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254456780] [2022-04-08 08:59:34,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254456780] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:34,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055088332] [2022-04-08 08:59:34,821 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:59:34,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:34,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:34,822 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:34,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 08:59:34,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:59:34,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:34,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 08:59:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:34,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:35,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2741#true} is VALID [2022-04-08 08:59:35,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-08 08:59:35,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-08 08:59:35,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-08 08:59:35,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-08 08:59:35,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {2741#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {2769#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {2769#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {2769#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {2769#(<= 5 main_~nodecount~0)} ~i~0 := 0; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:35,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:35,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:35,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:35,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:35,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:35,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2822#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:35,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {2822#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-08 08:59:35,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 08:59:35,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {2742#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 08:59:35,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {2742#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2742#false} is VALID [2022-04-08 08:59:35,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {2742#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2742#false} is VALID [2022-04-08 08:59:35,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-08 08:59:35,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 08:59:35,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 08:59:35,077 INFO L272 TraceCheckUtils]: 31: Hoare triple {2742#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2742#false} is VALID [2022-04-08 08:59:35,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-08 08:59:35,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-08 08:59:35,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-08 08:59:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 08:59:35,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:35,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-08 08:59:35,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-08 08:59:35,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-08 08:59:35,204 INFO L272 TraceCheckUtils]: 31: Hoare triple {2742#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2742#false} is VALID [2022-04-08 08:59:35,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 08:59:35,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 08:59:35,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-08 08:59:35,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {2742#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2742#false} is VALID [2022-04-08 08:59:35,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {2742#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2742#false} is VALID [2022-04-08 08:59:35,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {2742#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 08:59:35,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 08:59:35,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {2892#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-08 08:59:35,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2892#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:35,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:35,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:35,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:35,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:35,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {2915#(< 1 main_~nodecount~0)} ~i~0 := 0; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:35,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {2915#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {2915#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {2915#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {2915#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {2741#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:35,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-08 08:59:35,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-08 08:59:35,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-08 08:59:35,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-08 08:59:35,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2741#true} is VALID [2022-04-08 08:59:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 08:59:35,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055088332] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:35,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:35,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-08 08:59:35,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:35,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [910751568] [2022-04-08 08:59:35,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [910751568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:35,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:35,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:59:35,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597037443] [2022-04-08 08:59:35,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:35,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 08:59:35,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:35,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:35,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:35,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:59:35,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:35,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:59:35,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 08:59:35,252 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:35,454 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-08 08:59:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:59:35,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 08:59:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-08 08:59:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-08 08:59:35,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-08 08:59:35,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:35,509 INFO L225 Difference]: With dead ends: 69 [2022-04-08 08:59:35,509 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 08:59:35,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-04-08 08:59:35,510 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:35,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 43 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 08:59:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-08 08:59:35,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:35,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:35,544 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:35,544 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:35,545 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 08:59:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 08:59:35,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:35,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:35,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 45 states. [2022-04-08 08:59:35,546 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 45 states. [2022-04-08 08:59:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:35,546 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 08:59:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 08:59:35,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:35,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:35,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:35,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-08 08:59:35,547 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 35 [2022-04-08 08:59:35,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:35,548 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-08 08:59:35,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:35,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 49 transitions. [2022-04-08 08:59:35,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 08:59:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 08:59:35,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:35,593 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:35,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:35,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:35,807 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash 385921679, now seen corresponding path program 5 times [2022-04-08 08:59:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:35,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [954073532] [2022-04-08 08:59:35,811 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:35,811 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 385921679, now seen corresponding path program 6 times [2022-04-08 08:59:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:35,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983752996] [2022-04-08 08:59:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:35,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:35,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:35,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {3298#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-08 08:59:35,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-08 08:59:35,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-08 08:59:35,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3298#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:35,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {3298#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-08 08:59:35,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-08 08:59:35,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-08 08:59:35,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-08 08:59:35,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {3288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:35,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:35,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:35,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:35,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0); {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:35,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:35,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 08:59:35,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0); {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 08:59:35,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 08:59:35,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 08:59:35,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~nodecount~0); {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 08:59:35,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 08:59:35,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3297#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 08:59:35,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {3297#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-08 08:59:35,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 08:59:35,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3289#false} is VALID [2022-04-08 08:59:35,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3289#false} is VALID [2022-04-08 08:59:35,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {3289#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3289#false} is VALID [2022-04-08 08:59:35,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {3289#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3289#false} is VALID [2022-04-08 08:59:35,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#false} assume !(~j~0 < ~edgecount~0); {3289#false} is VALID [2022-04-08 08:59:35,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3289#false} is VALID [2022-04-08 08:59:35,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#false} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {3289#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L272 TraceCheckUtils]: 34: Hoare triple {3289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-08 08:59:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:59:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:35,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983752996] [2022-04-08 08:59:35,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983752996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:35,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695832086] [2022-04-08 08:59:35,897 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:59:35,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:35,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:35,898 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:35,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 08:59:35,971 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 08:59:35,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:35,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 08:59:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:35,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:36,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3288#true} is VALID [2022-04-08 08:59:36,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {3288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-08 08:59:36,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-08 08:59:36,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-08 08:59:36,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-08 08:59:36,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {3288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {3317#(<= 5 main_~nodecount~0)} ~i~0 := 0; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:36,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:36,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:36,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:36,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:36,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:36,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3379#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:36,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {3379#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-08 08:59:36,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 08:59:36,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {3289#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 08:59:36,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3289#false} is VALID [2022-04-08 08:59:36,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3289#false} is VALID [2022-04-08 08:59:36,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-08 08:59:36,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 08:59:36,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 08:59:36,175 INFO L272 TraceCheckUtils]: 34: Hoare triple {3289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3289#false} is VALID [2022-04-08 08:59:36,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-08 08:59:36,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-08 08:59:36,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-08 08:59:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 08:59:36,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:36,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-08 08:59:36,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-08 08:59:36,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-08 08:59:36,328 INFO L272 TraceCheckUtils]: 34: Hoare triple {3289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3289#false} is VALID [2022-04-08 08:59:36,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 08:59:36,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 08:59:36,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-08 08:59:36,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3289#false} is VALID [2022-04-08 08:59:36,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3289#false} is VALID [2022-04-08 08:59:36,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {3289#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 08:59:36,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 08:59:36,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {3449#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-08 08:59:36,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3449#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:36,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:36,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:36,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:36,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:36,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {3472#(< 1 main_~nodecount~0)} ~i~0 := 0; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:36,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {3472#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {3288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:36,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-08 08:59:36,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-08 08:59:36,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-08 08:59:36,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {3288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-08 08:59:36,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3288#true} is VALID [2022-04-08 08:59:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 08:59:36,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695832086] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:36,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:36,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-04-08 08:59:36,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:36,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [954073532] [2022-04-08 08:59:36,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [954073532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:36,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:36,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:59:36,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360076198] [2022-04-08 08:59:36,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:36,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 08:59:36,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:36,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:36,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:36,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:59:36,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:36,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:59:36,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:59:36,372 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:36,625 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-08 08:59:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:59:36,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 08:59:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-08 08:59:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-08 08:59:36,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-04-08 08:59:36,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:36,680 INFO L225 Difference]: With dead ends: 72 [2022-04-08 08:59:36,680 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 08:59:36,681 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2022-04-08 08:59:36,681 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:36,681 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 43 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 08:59:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-04-08 08:59:36,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:36,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:36,722 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:36,722 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:36,723 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 08:59:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-08 08:59:36,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:36,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:36,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 48 states. [2022-04-08 08:59:36,724 INFO L87 Difference]: Start difference. First operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 48 states. [2022-04-08 08:59:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:36,724 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 08:59:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-08 08:59:36,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:36,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:36,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:36,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-04-08 08:59:36,725 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 38 [2022-04-08 08:59:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:36,726 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-04-08 08:59:36,726 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:36,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 52 transitions. [2022-04-08 08:59:36,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-04-08 08:59:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 08:59:36,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:36,777 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:36,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:36,993 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 08:59:36,993 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:36,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1361731471, now seen corresponding path program 7 times [2022-04-08 08:59:36,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:36,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1331910426] [2022-04-08 08:59:36,998 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:36,998 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1361731471, now seen corresponding path program 8 times [2022-04-08 08:59:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:36,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090162334] [2022-04-08 08:59:36,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:37,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:37,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {3882#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-08 08:59:37,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-08 08:59:37,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-08 08:59:37,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3882#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:37,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {3882#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-08 08:59:37,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-08 08:59:37,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-08 08:59:37,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-08 08:59:37,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {3874#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:37,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:37,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:37,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3881#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:37,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {3881#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {3875#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {3875#false} assume !(~i~0 < ~nodecount~0); {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {3875#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {3875#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {3875#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {3875#false} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {3875#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L272 TraceCheckUtils]: 37: Hoare triple {3875#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-08 08:59:37,082 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-08 08:59:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:37,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090162334] [2022-04-08 08:59:37,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090162334] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:37,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792664368] [2022-04-08 08:59:37,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:37,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:37,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:37,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:37,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 08:59:37,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:37,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:37,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 08:59:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:37,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:37,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3874#true} is VALID [2022-04-08 08:59:37,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-08 08:59:37,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-08 08:59:37,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-08 08:59:37,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-08 08:59:37,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {3874#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:37,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:37,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:37,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3986#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:37,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {3986#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-08 08:59:37,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-08 08:59:37,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {3875#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-08 08:59:37,358 INFO L272 TraceCheckUtils]: 37: Hoare triple {3875#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3875#false} is VALID [2022-04-08 08:59:37,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-08 08:59:37,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-08 08:59:37,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-08 08:59:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 08:59:37,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:37,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-08 08:59:37,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-08 08:59:37,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-08 08:59:37,513 INFO L272 TraceCheckUtils]: 37: Hoare triple {3875#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3875#false} is VALID [2022-04-08 08:59:37,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {3875#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-08 08:59:37,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-08 08:59:37,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {4026#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-08 08:59:37,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {4030#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4026#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {4030#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4030#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:37,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {4030#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4030#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:37,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {4040#(< 1 main_~edgecount~0)} ~i~0 := 0; {4030#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:37,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {4040#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {4040#(< 1 main_~edgecount~0)} ~i~0 := 0; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {4040#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {3874#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:37,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-08 08:59:37,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-08 08:59:37,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-08 08:59:37,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-08 08:59:37,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3874#true} is VALID [2022-04-08 08:59:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 08:59:37,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792664368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:37,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:37,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-04-08 08:59:37,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:37,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1331910426] [2022-04-08 08:59:37,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1331910426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:37,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:37,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:59:37,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976205318] [2022-04-08 08:59:37,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:37,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 08:59:37,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:37,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:37,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:37,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:59:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:59:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:59:37,560 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:37,805 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-08 08:59:37,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:59:37,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 08:59:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-08 08:59:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-08 08:59:37,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-08 08:59:37,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:37,856 INFO L225 Difference]: With dead ends: 73 [2022-04-08 08:59:37,856 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 08:59:37,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:59:37,857 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:37,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 45 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 08:59:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-04-08 08:59:37,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:37,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:37,903 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:37,903 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:37,904 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 08:59:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 08:59:37,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:37,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:37,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 51 states. [2022-04-08 08:59:37,905 INFO L87 Difference]: Start difference. First operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 51 states. [2022-04-08 08:59:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:37,905 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 08:59:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 08:59:37,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:37,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:37,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:37,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-04-08 08:59:37,906 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 41 [2022-04-08 08:59:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:37,906 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-04-08 08:59:37,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:37,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 56 transitions. [2022-04-08 08:59:37,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-04-08 08:59:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 08:59:37,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:37,972 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:37,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:38,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:38,173 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:38,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1307195270, now seen corresponding path program 9 times [2022-04-08 08:59:38,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:38,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1279686198] [2022-04-08 08:59:38,179 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:38,179 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1307195270, now seen corresponding path program 10 times [2022-04-08 08:59:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:38,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999895798] [2022-04-08 08:59:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:38,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:38,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:38,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {4494#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-08 08:59:38,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-08 08:59:38,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-08 08:59:38,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4494#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:38,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {4494#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-08 08:59:38,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-08 08:59:38,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-08 08:59:38,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-08 08:59:38,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {4490#(<= 20 main_~edgecount~0)} ~i~0 := 0; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:38,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:38,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:38,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:38,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:38,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:38,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4493#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:38,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {4493#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4486#false} is VALID [2022-04-08 08:59:38,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {4486#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {4486#false} assume !(~i~0 < ~nodecount~0); {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {4486#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {4486#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {4486#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {4486#false} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {4486#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L272 TraceCheckUtils]: 40: Hoare triple {4486#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-08 08:59:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:38,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:38,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999895798] [2022-04-08 08:59:38,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999895798] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:38,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985015027] [2022-04-08 08:59:38,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:59:38,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:38,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:38,277 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:38,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 08:59:38,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:59:38,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:38,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 08:59:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:38,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:38,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4485#true} is VALID [2022-04-08 08:59:38,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-08 08:59:38,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {4485#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 08:59:38,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 08:59:38,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {4485#true} assume !(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {4485#true} ~i~0 := 0; {4485#true} is VALID [2022-04-08 08:59:38,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:38,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {4567#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:38,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {4567#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:38,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {4567#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4577#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:38,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {4577#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {4581#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {4581#(< 1 main_~edgecount~0)} ~i~0 := 0; {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} is VALID [2022-04-08 08:59:38,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} is VALID [2022-04-08 08:59:38,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} is VALID [2022-04-08 08:59:38,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4610#(and (<= main_~i~0 1) (< 1 main_~edgecount~0))} is VALID [2022-04-08 08:59:38,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#(and (<= main_~i~0 1) (< 1 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-08 08:59:38,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-08 08:59:38,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {4486#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-08 08:59:38,550 INFO L272 TraceCheckUtils]: 40: Hoare triple {4486#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4486#false} is VALID [2022-04-08 08:59:38,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-08 08:59:38,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-08 08:59:38,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-08 08:59:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 08:59:38,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:38,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-08 08:59:38,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-08 08:59:38,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-08 08:59:38,696 INFO L272 TraceCheckUtils]: 40: Hoare triple {4486#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4486#false} is VALID [2022-04-08 08:59:38,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {4486#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-08 08:59:38,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-08 08:59:38,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {4650#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-08 08:59:38,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {4654#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4650#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {4654#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4654#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:38,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {4654#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4654#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:38,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {4581#(< 1 main_~edgecount~0)} ~i~0 := 0; {4654#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:38,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {4581#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {4577#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:38,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {4567#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4577#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:38,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {4567#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:38,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {4567#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {4485#true} ~i~0 := 0; {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {4485#true} assume !(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 08:59:38,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {4485#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 08:59:38,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 08:59:38,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4485#true} is VALID [2022-04-08 08:59:38,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-08 08:59:38,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-08 08:59:38,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-08 08:59:38,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-08 08:59:38,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4485#true} is VALID [2022-04-08 08:59:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 08:59:38,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985015027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:38,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:38,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-04-08 08:59:38,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:38,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1279686198] [2022-04-08 08:59:38,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1279686198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:38,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:38,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:59:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412615834] [2022-04-08 08:59:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:38,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 08:59:38,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:38,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:38,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:38,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:59:38,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:38,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:59:38,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:59:38,733 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:38,987 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-08 08:59:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:59:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 08:59:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-08 08:59:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-08 08:59:38,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-08 08:59:39,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:39,052 INFO L225 Difference]: With dead ends: 79 [2022-04-08 08:59:39,052 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 08:59:39,052 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-04-08 08:59:39,052 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 74 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:39,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 45 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 08:59:39,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-08 08:59:39,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:39,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:39,112 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:39,112 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:39,113 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 08:59:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 08:59:39,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:39,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:39,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 54 states. [2022-04-08 08:59:39,114 INFO L87 Difference]: Start difference. First operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 54 states. [2022-04-08 08:59:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:39,114 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 08:59:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 08:59:39,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:39,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:39,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:39,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-08 08:59:39,115 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 44 [2022-04-08 08:59:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:39,116 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-08 08:59:39,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:39,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-08 08:59:39,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-08 08:59:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 08:59:39,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:39,186 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:39,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:39,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:39,396 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash -116869167, now seen corresponding path program 11 times [2022-04-08 08:59:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:39,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [208900076] [2022-04-08 08:59:39,409 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:39,409 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:39,409 INFO L85 PathProgramCache]: Analyzing trace with hash -116869167, now seen corresponding path program 12 times [2022-04-08 08:59:39,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:39,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747770677] [2022-04-08 08:59:39,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:39,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {5153#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-08 08:59:39,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-08 08:59:39,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-08 08:59:39,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5153#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:39,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {5153#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-08 08:59:39,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-08 08:59:39,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-08 08:59:39,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-08 08:59:39,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {5148#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:39,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:39,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:39,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:39,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:39,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:39,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:39,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:39,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:39,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:39,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5152#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {5152#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {5144#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {5144#false} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {5144#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {5144#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {5144#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L272 TraceCheckUtils]: 43: Hoare triple {5144#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-08 08:59:39,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-08 08:59:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:39,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:39,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747770677] [2022-04-08 08:59:39,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747770677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:39,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197344400] [2022-04-08 08:59:39,491 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:59:39,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:39,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:39,492 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:39,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 08:59:39,575 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 08:59:39,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:39,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 08:59:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:39,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:39,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2022-04-08 08:59:39,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-08 08:59:39,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-08 08:59:39,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-08 08:59:39,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-08 08:59:39,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {5172#(<= 5 main_~nodecount~0)} ~i~0 := 0; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5261#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:39,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {5261#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-08 08:59:39,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 08:59:39,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {5144#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 08:59:39,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {5144#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5144#false} is VALID [2022-04-08 08:59:39,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {5144#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5144#false} is VALID [2022-04-08 08:59:39,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-08 08:59:39,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 08:59:39,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 08:59:39,775 INFO L272 TraceCheckUtils]: 43: Hoare triple {5144#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5144#false} is VALID [2022-04-08 08:59:39,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-08 08:59:39,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-08 08:59:39,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-08 08:59:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 08:59:39,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L272 TraceCheckUtils]: 43: Hoare triple {5144#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {5144#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {5144#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {5144#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 08:59:39,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {5331#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-08 08:59:39,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5331#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {5372#(< 1 main_~nodecount~0)} ~i~0 := 0; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:39,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {5372#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:39,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-08 08:59:39,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-08 08:59:39,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-08 08:59:39,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-08 08:59:39,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2022-04-08 08:59:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 08:59:39,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197344400] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:39,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:39,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-04-08 08:59:39,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:39,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [208900076] [2022-04-08 08:59:39,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [208900076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:39,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:39,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:59:39,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120934843] [2022-04-08 08:59:39,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:39,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 08:59:39,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:39,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:39,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:39,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:59:39,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:39,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:59:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:59:39,960 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:40,286 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-04-08 08:59:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:59:40,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 08:59:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-08 08:59:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-08 08:59:40,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-04-08 08:59:40,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:40,348 INFO L225 Difference]: With dead ends: 85 [2022-04-08 08:59:40,348 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 08:59:40,349 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-04-08 08:59:40,349 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:40,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 50 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:40,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 08:59:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-08 08:59:40,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:40,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:40,406 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:40,406 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:40,407 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 08:59:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 08:59:40,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:40,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:40,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-08 08:59:40,408 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-08 08:59:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:40,408 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 08:59:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 08:59:40,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:40,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:40,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:40,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-04-08 08:59:40,410 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 47 [2022-04-08 08:59:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:40,410 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-04-08 08:59:40,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:40,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 64 transitions. [2022-04-08 08:59:40,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-04-08 08:59:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 08:59:40,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:40,472 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:40,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:40,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 08:59:40,673 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:40,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:40,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1638069530, now seen corresponding path program 13 times [2022-04-08 08:59:40,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:40,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [626879612] [2022-04-08 08:59:40,677 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:40,677 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1638069530, now seen corresponding path program 14 times [2022-04-08 08:59:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:40,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879980466] [2022-04-08 08:59:40,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:40,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:40,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {5856#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-08 08:59:40,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-08 08:59:40,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-08 08:59:40,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5856#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:40,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {5856#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-08 08:59:40,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-08 08:59:40,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-08 08:59:40,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-08 08:59:40,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {5850#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:40,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:40,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:40,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:40,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:40,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:40,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:40,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:40,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:40,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:40,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:40,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:40,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:40,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5855#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:40,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {5855#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {5846#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L272 TraceCheckUtils]: 46: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-08 08:59:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:40,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:40,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879980466] [2022-04-08 08:59:40,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879980466] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:40,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774063942] [2022-04-08 08:59:40,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:40,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:40,795 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:40,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 08:59:40,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:40,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:40,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 08:59:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:40,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:41,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-08 08:59:41,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-08 08:59:41,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-08 08:59:41,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-08 08:59:41,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-08 08:59:41,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {5850#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:41,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:41,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:41,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:41,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:41,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:41,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:41,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:41,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:41,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:41,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:41,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5969#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {5969#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(~j~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {5846#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L272 TraceCheckUtils]: 46: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5846#false} is VALID [2022-04-08 08:59:41,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-08 08:59:41,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-08 08:59:41,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-08 08:59:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:41,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:41,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-08 08:59:41,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L272 TraceCheckUtils]: 46: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {5846#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-08 08:59:41,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5846#false} is VALID [2022-04-08 08:59:41,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {6051#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 08:59:41,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {6055#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6051#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {6055#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6055#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {6055#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6055#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {6065#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6055#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {6065#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6065#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {6065#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6065#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {6075#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6065#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {6075#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6075#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {6075#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6075#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {6085#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6075#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {6085#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6085#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {6085#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6085#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6085#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:41,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {6095#(< 4 main_~edgecount~0)} ~i~0 := 0; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {6095#(< 4 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:41,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-08 08:59:41,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-08 08:59:41,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-08 08:59:41,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-08 08:59:41,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-08 08:59:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:41,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774063942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:41,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:41,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-04-08 08:59:41,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:41,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [626879612] [2022-04-08 08:59:41,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [626879612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:41,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:41,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:59:41,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147557028] [2022-04-08 08:59:41,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:41,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 08:59:41,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:41,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:41,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:41,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:59:41,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:41,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:59:41,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-08 08:59:41,398 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:41,660 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-08 08:59:41,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 08:59:41,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 08:59:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-08 08:59:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-08 08:59:41,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2022-04-08 08:59:41,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:41,731 INFO L225 Difference]: With dead ends: 91 [2022-04-08 08:59:41,731 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 08:59:41,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2022-04-08 08:59:41,732 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 97 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:41,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 40 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 08:59:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-04-08 08:59:41,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:41,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:41,799 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:41,799 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:41,800 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 08:59:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 08:59:41,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:41,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:41,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 60 states. [2022-04-08 08:59:41,800 INFO L87 Difference]: Start difference. First operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 60 states. [2022-04-08 08:59:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:41,801 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 08:59:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 08:59:41,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:41,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:41,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:41,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-04-08 08:59:41,802 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 50 [2022-04-08 08:59:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:41,802 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-04-08 08:59:41,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:41,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 68 transitions. [2022-04-08 08:59:41,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-04-08 08:59:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 08:59:41,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:41,872 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:41,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:42,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 08:59:42,073 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:42,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:42,073 INFO L85 PathProgramCache]: Analyzing trace with hash 379897649, now seen corresponding path program 15 times [2022-04-08 08:59:42,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:42,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [86905724] [2022-04-08 08:59:42,076 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:42,077 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:42,077 INFO L85 PathProgramCache]: Analyzing trace with hash 379897649, now seen corresponding path program 16 times [2022-04-08 08:59:42,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:42,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077811855] [2022-04-08 08:59:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:42,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:42,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:42,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {6609#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-08 08:59:42,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-08 08:59:42,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-08 08:59:42,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6609#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:42,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {6609#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-08 08:59:42,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-08 08:59:42,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-08 08:59:42,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-08 08:59:42,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {6597#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {6602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:42,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:42,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:42,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6608#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {6608#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {6598#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {6598#false} assume !(~i~0 < ~nodecount~0); {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {6598#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {6598#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {6598#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {6598#false} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {6598#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L272 TraceCheckUtils]: 49: Hoare triple {6598#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-08 08:59:42,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-08 08:59:42,219 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-08 08:59:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:42,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:42,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077811855] [2022-04-08 08:59:42,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077811855] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:42,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941639865] [2022-04-08 08:59:42,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:59:42,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:42,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:42,221 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:42,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 08:59:42,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:59:42,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:42,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 08:59:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:42,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:42,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6597#true} is VALID [2022-04-08 08:59:42,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {6597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-08 08:59:42,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-08 08:59:42,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-08 08:59:42,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-08 08:59:42,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {6597#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6597#true} is VALID [2022-04-08 08:59:42,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {6597#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {6597#true} assume !(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {6597#true} ~i~0 := 0; {6597#true} is VALID [2022-04-08 08:59:42,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:42,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {6682#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:42,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {6682#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:42,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {6682#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6692#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:42,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {6692#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6692#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:42,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {6692#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6692#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:42,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {6692#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6702#(<= 2 main_~j~0)} is VALID [2022-04-08 08:59:42,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {6702#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6702#(<= 2 main_~j~0)} is VALID [2022-04-08 08:59:42,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {6702#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6702#(<= 2 main_~j~0)} is VALID [2022-04-08 08:59:42,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {6702#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6712#(<= 3 main_~j~0)} is VALID [2022-04-08 08:59:42,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {6712#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6712#(<= 3 main_~j~0)} is VALID [2022-04-08 08:59:42,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {6712#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6712#(<= 3 main_~j~0)} is VALID [2022-04-08 08:59:42,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {6712#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6722#(<= 4 main_~j~0)} is VALID [2022-04-08 08:59:42,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {6722#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {6726#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {6726#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {6726#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {6726#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {6726#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {6726#(< 4 main_~edgecount~0)} ~i~0 := 0; {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} is VALID [2022-04-08 08:59:42,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} is VALID [2022-04-08 08:59:42,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} is VALID [2022-04-08 08:59:42,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6755#(and (<= main_~i~0 1) (< 4 main_~edgecount~0))} is VALID [2022-04-08 08:59:42,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {6755#(and (<= main_~i~0 1) (< 4 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-08 08:59:42,585 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-08 08:59:42,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {6598#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-08 08:59:42,585 INFO L272 TraceCheckUtils]: 49: Hoare triple {6598#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6598#false} is VALID [2022-04-08 08:59:42,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-08 08:59:42,585 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-08 08:59:42,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-08 08:59:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 08:59:42,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:42,791 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-08 08:59:42,791 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-08 08:59:42,791 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-08 08:59:42,791 INFO L272 TraceCheckUtils]: 49: Hoare triple {6598#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6598#false} is VALID [2022-04-08 08:59:42,791 INFO L290 TraceCheckUtils]: 48: Hoare triple {6598#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-08 08:59:42,791 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-08 08:59:42,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {6795#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-08 08:59:42,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {6799#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6795#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {6799#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6799#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {6799#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6799#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {6809#(< 1 main_~edgecount~0)} ~i~0 := 0; {6799#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:42,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {6809#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {6809#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {6809#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {6809#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {6809#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {6692#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:42,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {6682#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6692#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:42,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {6682#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:42,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {6682#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:42,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {6840#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:42,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {6840#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6840#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 08:59:42,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {6840#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6840#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 08:59:42,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {6850#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6840#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 08:59:42,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {6850#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6850#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 08:59:42,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {6850#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6850#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 08:59:42,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {6860#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6850#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 08:59:42,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {6860#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6860#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 08:59:42,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {6860#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6860#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 08:59:42,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6860#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 08:59:42,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {6597#true} ~i~0 := 0; {6597#true} is VALID [2022-04-08 08:59:42,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {6597#true} assume !(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 08:59:42,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 08:59:42,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 08:59:42,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {6597#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {6597#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {6597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-08 08:59:42,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6597#true} is VALID [2022-04-08 08:59:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 08:59:42,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941639865] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:42,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:42,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-04-08 08:59:42,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:42,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [86905724] [2022-04-08 08:59:42,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [86905724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:42,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:42,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 08:59:42,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942758169] [2022-04-08 08:59:42,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:42,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-08 08:59:42,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:42,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:42,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:42,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 08:59:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:42,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 08:59:42,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-08 08:59:42,841 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:43,210 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2022-04-08 08:59:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 08:59:43,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-08 08:59:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-08 08:59:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-08 08:59:43,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-08 08:59:43,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:43,278 INFO L225 Difference]: With dead ends: 97 [2022-04-08 08:59:43,278 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 08:59:43,278 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2022-04-08 08:59:43,279 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 102 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:43,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 50 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 08:59:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-04-08 08:59:43,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:43,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,336 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,336 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:43,337 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 08:59:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-08 08:59:43,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:43,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:43,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 63 states. [2022-04-08 08:59:43,338 INFO L87 Difference]: Start difference. First operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 63 states. [2022-04-08 08:59:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:43,338 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 08:59:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-08 08:59:43,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:43,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:43,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:43,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-04-08 08:59:43,339 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 53 [2022-04-08 08:59:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:43,340 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-04-08 08:59:43,340 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 72 transitions. [2022-04-08 08:59:43,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-04-08 08:59:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 08:59:43,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:43,443 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:43,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:43,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 08:59:43,659 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash 360982970, now seen corresponding path program 17 times [2022-04-08 08:59:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:43,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1332218618] [2022-04-08 08:59:43,663 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:43,663 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash 360982970, now seen corresponding path program 18 times [2022-04-08 08:59:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:43,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853798744] [2022-04-08 08:59:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:43,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:43,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:43,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {7410#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-08 08:59:43,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-08 08:59:43,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-08 08:59:43,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7410#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:43,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-08 08:59:43,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-08 08:59:43,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-08 08:59:43,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-08 08:59:43,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:43,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:43,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:43,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:43,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7409#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:43,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {7409#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7398#false} is VALID [2022-04-08 08:59:43,787 INFO L290 TraceCheckUtils]: 43: Hoare triple {7398#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7398#false} is VALID [2022-04-08 08:59:43,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {7398#false} assume !(~i~0 < ~nodecount~0); {7398#false} is VALID [2022-04-08 08:59:43,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-08 08:59:43,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {7398#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-08 08:59:43,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {7398#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7398#false} is VALID [2022-04-08 08:59:43,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {7398#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7398#false} is VALID [2022-04-08 08:59:43,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {7398#false} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-08 08:59:43,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-08 08:59:43,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {7398#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-08 08:59:43,788 INFO L272 TraceCheckUtils]: 52: Hoare triple {7398#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7398#false} is VALID [2022-04-08 08:59:43,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-08 08:59:43,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-08 08:59:43,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-08 08:59:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:43,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:43,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853798744] [2022-04-08 08:59:43,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853798744] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:43,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566322508] [2022-04-08 08:59:43,789 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:59:43,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:43,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:43,790 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:43,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 08:59:43,895 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 08:59:43,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:43,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 08:59:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:43,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:44,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-08 08:59:44,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-08 08:59:44,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-08 08:59:44,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-08 08:59:44,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-08 08:59:44,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,110 INFO L290 TraceCheckUtils]: 41: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,111 INFO L290 TraceCheckUtils]: 45: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:44,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:44,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:44,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7559#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:44,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {7559#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-08 08:59:44,122 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-08 08:59:44,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {7398#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-08 08:59:44,123 INFO L272 TraceCheckUtils]: 52: Hoare triple {7398#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7398#false} is VALID [2022-04-08 08:59:44,123 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-08 08:59:44,123 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-08 08:59:44,123 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-08 08:59:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-04-08 08:59:44,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:44,308 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-08 08:59:44,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-08 08:59:44,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-08 08:59:44,309 INFO L272 TraceCheckUtils]: 52: Hoare triple {7398#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7398#false} is VALID [2022-04-08 08:59:44,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {7398#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-08 08:59:44,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-08 08:59:44,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {7599#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-08 08:59:44,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {7603#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7599#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {7603#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7603#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:44,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {7603#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7603#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:44,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {7613#(< 1 main_~edgecount~0)} ~i~0 := 0; {7603#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:44,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {7613#(< 1 main_~edgecount~0)} ~i~0 := 0; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {7613#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:44,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-08 08:59:44,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-08 08:59:44,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-08 08:59:44,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-08 08:59:44,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-08 08:59:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-04-08 08:59:44,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566322508] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:44,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:44,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2022-04-08 08:59:44,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:44,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1332218618] [2022-04-08 08:59:44,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1332218618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:44,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:44,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:59:44,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281772709] [2022-04-08 08:59:44,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:44,323 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-08 08:59:44,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:44,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:44,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:44,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 08:59:44,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:44,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 08:59:44,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-04-08 08:59:44,353 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:44,817 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-08 08:59:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 08:59:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-08 08:59:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-04-08 08:59:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-04-08 08:59:44,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 89 transitions. [2022-04-08 08:59:44,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:44,885 INFO L225 Difference]: With dead ends: 103 [2022-04-08 08:59:44,885 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 08:59:44,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2022-04-08 08:59:44,886 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 110 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:44,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 60 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:44,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 08:59:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-08 08:59:44,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:44,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:44,951 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:44,951 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:44,952 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-08 08:59:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 08:59:44,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:44,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:44,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 66 states. [2022-04-08 08:59:44,956 INFO L87 Difference]: Start difference. First operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 66 states. [2022-04-08 08:59:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:44,958 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-08 08:59:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 08:59:44,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:44,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:44,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:44,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-04-08 08:59:44,959 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 56 [2022-04-08 08:59:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:44,959 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-04-08 08:59:44,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:44,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 76 transitions. [2022-04-08 08:59:45,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-04-08 08:59:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 08:59:45,044 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:45,044 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:45,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:45,260 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 08:59:45,260 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:45,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash -485503343, now seen corresponding path program 19 times [2022-04-08 08:59:45,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:45,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2101603334] [2022-04-08 08:59:45,264 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:45,264 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:45,264 INFO L85 PathProgramCache]: Analyzing trace with hash -485503343, now seen corresponding path program 20 times [2022-04-08 08:59:45,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:45,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508027803] [2022-04-08 08:59:45,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:45,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:45,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:45,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {8247#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-08 08:59:45,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-08 08:59:45,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-08 08:59:45,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8247#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:45,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {8247#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-08 08:59:45,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-08 08:59:45,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-08 08:59:45,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-08 08:59:45,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {8238#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:45,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:45,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:45,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,427 INFO L290 TraceCheckUtils]: 41: Hoare triple {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8246#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:45,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {8246#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 08:59:45,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8234#false} is VALID [2022-04-08 08:59:45,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-08 08:59:45,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 08:59:45,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 08:59:45,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8234#false} is VALID [2022-04-08 08:59:45,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8234#false} is VALID [2022-04-08 08:59:45,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 08:59:45,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 08:59:45,430 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 08:59:45,430 INFO L272 TraceCheckUtils]: 55: Hoare triple {8234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8234#false} is VALID [2022-04-08 08:59:45,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-08 08:59:45,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-08 08:59:45,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-08 08:59:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:45,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:45,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508027803] [2022-04-08 08:59:45,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508027803] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:45,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297517417] [2022-04-08 08:59:45,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:45,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:45,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:45,431 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:45,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 08:59:45,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:45,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:45,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 08:59:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:45,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:45,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8233#true} is VALID [2022-04-08 08:59:45,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {8233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-08 08:59:45,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-08 08:59:45,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-08 08:59:45,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-08 08:59:45,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {8238#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:45,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:45,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:45,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:45,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:45,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:45,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:45,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:45,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:45,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:45,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:45,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:45,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:45,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:45,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:45,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:45,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:45,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:45,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:45,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:45,942 INFO L290 TraceCheckUtils]: 42: Hoare triple {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:45,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:45,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8390#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 45: Hoare triple {8390#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L272 TraceCheckUtils]: 55: Hoare triple {8234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-08 08:59:45,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-08 08:59:45,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-08 08:59:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:45,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:46,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-08 08:59:46,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-08 08:59:46,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-08 08:59:46,241 INFO L272 TraceCheckUtils]: 55: Hoare triple {8234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8234#false} is VALID [2022-04-08 08:59:46,241 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 08:59:46,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 08:59:46,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 08:59:46,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8234#false} is VALID [2022-04-08 08:59:46,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8234#false} is VALID [2022-04-08 08:59:46,242 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 08:59:46,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 08:59:46,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-08 08:59:46,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8234#false} is VALID [2022-04-08 08:59:46,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {8472#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 08:59:46,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {8476#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8472#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {8476#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8476#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {8476#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8476#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {8486#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8476#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {8486#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8486#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {8486#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8486#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {8496#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8486#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {8496#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8496#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {8496#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8496#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {8506#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8496#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {8506#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8506#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {8506#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8506#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8506#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {8526#(< (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {8526#(< (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8526#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {8526#(< (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8526#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8526#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:46,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {8546#(< 7 main_~edgecount~0)} ~i~0 := 0; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {8546#(< 7 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:46,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-08 08:59:46,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-08 08:59:46,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-08 08:59:46,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {8233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-08 08:59:46,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8233#true} is VALID [2022-04-08 08:59:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:46,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297517417] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:46,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:46,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-04-08 08:59:46,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2101603334] [2022-04-08 08:59:46,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2101603334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:46,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:46,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:59:46,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577531784] [2022-04-08 08:59:46,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:46,257 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-08 08:59:46,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:46,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:46,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:46,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 08:59:46,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:46,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 08:59:46,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=483, Unknown=0, NotChecked=0, Total=812 [2022-04-08 08:59:46,288 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:46,724 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2022-04-08 08:59:46,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 08:59:46,724 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-08 08:59:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-08 08:59:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-08 08:59:46,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 93 transitions. [2022-04-08 08:59:46,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:46,804 INFO L225 Difference]: With dead ends: 109 [2022-04-08 08:59:46,804 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 08:59:46,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=518, Invalid=888, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 08:59:46,809 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 124 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:46,809 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 50 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 08:59:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-08 08:59:46,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:46,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:46,890 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:46,890 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:46,891 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-08 08:59:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-04-08 08:59:46,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:46,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:46,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-04-08 08:59:46,892 INFO L87 Difference]: Start difference. First operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-04-08 08:59:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:46,893 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-08 08:59:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-04-08 08:59:46,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:46,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:46,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:46,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-04-08 08:59:46,894 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 59 [2022-04-08 08:59:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:46,894 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-04-08 08:59:46,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:46,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 80 transitions. [2022-04-08 08:59:47,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-08 08:59:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 08:59:47,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:47,003 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:47,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:47,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 08:59:47,204 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1888708186, now seen corresponding path program 21 times [2022-04-08 08:59:47,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:47,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [141779989] [2022-04-08 08:59:47,207 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:47,207 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1888708186, now seen corresponding path program 22 times [2022-04-08 08:59:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:47,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143483979] [2022-04-08 08:59:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:47,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:47,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:47,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {9141#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-08 08:59:47,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-08 08:59:47,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-08 08:59:47,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9141#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:47,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {9141#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-08 08:59:47,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-08 08:59:47,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-08 08:59:47,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-08 08:59:47,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {9131#(<= 20 main_~edgecount~0)} ~i~0 := 0; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:47,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:47,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:47,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,333 INFO L290 TraceCheckUtils]: 47: Hoare triple {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9140#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {9140#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {9127#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {9127#false} assume !(~i~0 < ~nodecount~0); {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 51: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {9127#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {9127#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {9127#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 55: Hoare triple {9127#false} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 57: Hoare triple {9127#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L272 TraceCheckUtils]: 58: Hoare triple {9127#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-08 08:59:47,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-08 08:59:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143483979] [2022-04-08 08:59:47,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143483979] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096684579] [2022-04-08 08:59:47,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:59:47,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:47,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:47,339 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:47,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 08:59:47,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:59:47,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:47,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 08:59:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:47,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:47,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {9126#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:47,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 08:59:47,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 08:59:47,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:47,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 08:59:47,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 08:59:47,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#true} assume !(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:47,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {9126#true} ~i~0 := 0; {9126#true} is VALID [2022-04-08 08:59:47,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:47,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {9214#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:47,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {9214#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:47,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {9214#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9224#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:47,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {9224#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9224#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:47,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {9224#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9224#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:47,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {9224#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9234#(<= 2 main_~j~0)} is VALID [2022-04-08 08:59:47,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {9234#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9234#(<= 2 main_~j~0)} is VALID [2022-04-08 08:59:47,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {9234#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9234#(<= 2 main_~j~0)} is VALID [2022-04-08 08:59:47,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {9234#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9244#(<= 3 main_~j~0)} is VALID [2022-04-08 08:59:47,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {9244#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9244#(<= 3 main_~j~0)} is VALID [2022-04-08 08:59:47,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {9244#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9244#(<= 3 main_~j~0)} is VALID [2022-04-08 08:59:47,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {9244#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9254#(<= 4 main_~j~0)} is VALID [2022-04-08 08:59:47,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {9254#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9254#(<= 4 main_~j~0)} is VALID [2022-04-08 08:59:47,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {9254#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9254#(<= 4 main_~j~0)} is VALID [2022-04-08 08:59:47,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {9254#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9264#(<= 5 main_~j~0)} is VALID [2022-04-08 08:59:47,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {9264#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9264#(<= 5 main_~j~0)} is VALID [2022-04-08 08:59:47,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {9264#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9264#(<= 5 main_~j~0)} is VALID [2022-04-08 08:59:47,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {9264#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9274#(<= 6 main_~j~0)} is VALID [2022-04-08 08:59:47,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {9274#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9274#(<= 6 main_~j~0)} is VALID [2022-04-08 08:59:47,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {9274#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9274#(<= 6 main_~j~0)} is VALID [2022-04-08 08:59:47,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {9274#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9284#(<= 7 main_~j~0)} is VALID [2022-04-08 08:59:47,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {9288#(< 7 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {9288#(< 7 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {9288#(< 7 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {9288#(< 7 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {9288#(< 7 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 08:59:47,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {9288#(< 7 main_~edgecount~0)} ~i~0 := 0; {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 08:59:47,779 INFO L290 TraceCheckUtils]: 52: Hoare triple {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 08:59:47,779 INFO L290 TraceCheckUtils]: 53: Hoare triple {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 08:59:47,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9317#(and (< 7 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 08:59:47,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {9317#(and (< 7 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-08 08:59:47,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-08 08:59:47,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {9127#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-08 08:59:47,780 INFO L272 TraceCheckUtils]: 58: Hoare triple {9127#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {9127#false} is VALID [2022-04-08 08:59:47,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-08 08:59:47,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-08 08:59:47,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-08 08:59:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 71 proven. 23 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 08:59:47,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:48,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-08 08:59:48,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-08 08:59:48,052 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-08 08:59:48,052 INFO L272 TraceCheckUtils]: 58: Hoare triple {9127#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {9127#false} is VALID [2022-04-08 08:59:48,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {9127#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-08 08:59:48,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-08 08:59:48,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {9357#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-08 08:59:48,066 INFO L290 TraceCheckUtils]: 54: Hoare triple {9361#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9357#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:48,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {9361#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {9361#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:48,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {9361#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9361#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:48,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {9371#(< 1 main_~edgecount~0)} ~i~0 := 0; {9361#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:48,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {9371#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:48,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {9371#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:48,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {9371#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:48,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {9371#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:48,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {9371#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:48,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {9224#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:48,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {9214#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9224#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:48,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {9214#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:48,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {9214#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:48,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {9402#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:48,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {9402#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9402#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 08:59:48,071 INFO L290 TraceCheckUtils]: 39: Hoare triple {9402#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9402#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 08:59:48,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {9412#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9402#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 08:59:48,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {9412#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9412#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 08:59:48,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {9412#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9412#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 08:59:48,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {9422#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9412#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 08:59:48,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {9422#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9422#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 08:59:48,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {9422#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9422#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 08:59:48,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {9432#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9422#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 08:59:48,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {9432#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9432#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 08:59:48,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {9432#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9432#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 08:59:48,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {9442#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9432#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 08:59:48,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {9442#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9442#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 08:59:48,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {9442#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9442#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 08:59:48,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {9452#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9442#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 08:59:48,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {9452#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9452#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 08:59:48,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {9452#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9452#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9452#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {9126#true} ~i~0 := 0; {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#true} assume !(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 08:59:48,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {9126#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2022-04-08 08:59:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 71 proven. 23 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 08:59:48,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096684579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:48,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:48,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-04-08 08:59:48,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:48,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [141779989] [2022-04-08 08:59:48,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [141779989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:48,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:48,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 08:59:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159014153] [2022-04-08 08:59:48,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:48,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-08 08:59:48,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:48,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:48,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:48,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 08:59:48,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:48,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 08:59:48,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 08:59:48,121 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:48,574 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-08 08:59:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:59:48,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-08 08:59:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-08 08:59:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-08 08:59:48,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-08 08:59:48,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:48,654 INFO L225 Difference]: With dead ends: 115 [2022-04-08 08:59:48,655 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 08:59:48,655 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=1436, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 08:59:48,656 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 137 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:48,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 45 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 08:59:48,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-04-08 08:59:48,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:48,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:48,747 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:48,747 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:48,756 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-08 08:59:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-04-08 08:59:48,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:48,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:48,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 72 states. [2022-04-08 08:59:48,756 INFO L87 Difference]: Start difference. First operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 72 states. [2022-04-08 08:59:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:48,757 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-08 08:59:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-04-08 08:59:48,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:48,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:48,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:48,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-04-08 08:59:48,758 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 62 [2022-04-08 08:59:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:48,758 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2022-04-08 08:59:48,759 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:48,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 84 transitions. [2022-04-08 08:59:48,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2022-04-08 08:59:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:59:48,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:48,862 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:48,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:49,062 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 08:59:49,062 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1792029199, now seen corresponding path program 23 times [2022-04-08 08:59:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:49,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1352131065] [2022-04-08 08:59:49,066 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:49,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1792029199, now seen corresponding path program 24 times [2022-04-08 08:59:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:49,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268401475] [2022-04-08 08:59:49,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:49,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {10083#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-08 08:59:49,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-08 08:59:49,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-08 08:59:49,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10083#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:49,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {10083#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-08 08:59:49,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-08 08:59:49,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-08 08:59:49,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-08 08:59:49,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:49,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:49,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:49,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:49,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:49,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:49,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:49,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:49,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:49,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:49,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,241 INFO L290 TraceCheckUtils]: 47: Hoare triple {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,242 INFO L290 TraceCheckUtils]: 49: Hoare triple {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:49,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10082#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 08:59:49,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {10082#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !(~j~0 < ~edgecount~0); {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {10068#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {10068#false} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 55: Hoare triple {10068#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {10068#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 57: Hoare triple {10068#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 60: Hoare triple {10068#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L272 TraceCheckUtils]: 61: Hoare triple {10068#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-08 08:59:49,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-08 08:59:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:49,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:49,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268401475] [2022-04-08 08:59:49,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268401475] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:49,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384369061] [2022-04-08 08:59:49,244 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:59:49,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:49,245 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:49,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 08:59:49,353 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 08:59:49,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:49,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 08:59:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:49,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:49,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10067#true} is VALID [2022-04-08 08:59:49,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-08 08:59:49,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-08 08:59:49,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-08 08:59:49,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-08 08:59:49,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {10102#(<= 5 main_~nodecount~0)} ~i~0 := 0; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10245#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 08:59:49,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {10245#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-08 08:59:49,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {10068#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {10068#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L290 TraceCheckUtils]: 57: Hoare triple {10068#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L290 TraceCheckUtils]: 60: Hoare triple {10068#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L272 TraceCheckUtils]: 61: Hoare triple {10068#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-08 08:59:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-08 08:59:49,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:49,873 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-08 08:59:49,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-08 08:59:49,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-08 08:59:49,873 INFO L272 TraceCheckUtils]: 61: Hoare triple {10068#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10068#false} is VALID [2022-04-08 08:59:49,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {10068#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 08:59:49,873 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 08:59:49,873 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-08 08:59:49,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {10068#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10068#false} is VALID [2022-04-08 08:59:49,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {10068#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10068#false} is VALID [2022-04-08 08:59:49,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {10068#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 08:59:49,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 08:59:49,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {10315#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-08 08:59:49,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10315#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {10410#(< 1 main_~nodecount~0)} ~i~0 := 0; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 08:59:49,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {10410#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 08:59:49,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-08 08:59:49,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-08 08:59:49,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-08 08:59:49,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-08 08:59:49,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10067#true} is VALID [2022-04-08 08:59:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-08 08:59:49,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384369061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:49,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:49,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 20 [2022-04-08 08:59:49,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:49,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1352131065] [2022-04-08 08:59:49,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1352131065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:49,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:49,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 08:59:49,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219450994] [2022-04-08 08:59:49,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:49,919 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:59:49,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:49,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:49,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:49,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 08:59:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 08:59:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-04-08 08:59:49,955 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:50,466 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2022-04-08 08:59:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 08:59:50,466 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:59:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-08 08:59:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-08 08:59:50,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 101 transitions. [2022-04-08 08:59:50,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:50,549 INFO L225 Difference]: With dead ends: 121 [2022-04-08 08:59:50,549 INFO L226 Difference]: Without dead ends: 75 [2022-04-08 08:59:50,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2022-04-08 08:59:50,550 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:50,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 50 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-08 08:59:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-04-08 08:59:50,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:50,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:50,645 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:50,647 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:50,648 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-08 08:59:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-04-08 08:59:50,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:50,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:50,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 75 states. [2022-04-08 08:59:50,649 INFO L87 Difference]: Start difference. First operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 75 states. [2022-04-08 08:59:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:50,650 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-08 08:59:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-04-08 08:59:50,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:50,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:50,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:50,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-08 08:59:50,651 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 65 [2022-04-08 08:59:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:50,651 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-08 08:59:50,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:50,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-08 08:59:50,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-08 08:59:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 08:59:50,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:50,766 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:50,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:50,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:50,979 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:50,986 INFO L85 PathProgramCache]: Analyzing trace with hash 170568442, now seen corresponding path program 25 times [2022-04-08 08:59:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:50,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [477391190] [2022-04-08 08:59:50,989 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:50,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash 170568442, now seen corresponding path program 26 times [2022-04-08 08:59:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:50,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304867301] [2022-04-08 08:59:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:51,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {11056#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-08 08:59:51,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-08 08:59:51,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-08 08:59:51,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11056#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:51,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {11056#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-08 08:59:51,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-08 08:59:51,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-08 08:59:51,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-08 08:59:51,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {11039#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {11044#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,203 INFO L290 TraceCheckUtils]: 50: Hoare triple {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 55: Hoare triple {11040#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {11040#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 59: Hoare triple {11040#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 60: Hoare triple {11040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 63: Hoare triple {11040#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L272 TraceCheckUtils]: 64: Hoare triple {11040#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-08 08:59:51,205 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-08 08:59:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:51,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304867301] [2022-04-08 08:59:51,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304867301] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:51,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327343236] [2022-04-08 08:59:51,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:51,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:51,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:51,207 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:51,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 08:59:51,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:51,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:51,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 08:59:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:51,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:51,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11039#true} is VALID [2022-04-08 08:59:51,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-08 08:59:51,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-08 08:59:51,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-08 08:59:51,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-08 08:59:51,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {11039#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {11044#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:51,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:51,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:51,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:51,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:51,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:51,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:51,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:51,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:51,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:51,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:51,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:51,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:51,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:51,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:51,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:51,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,834 INFO L290 TraceCheckUtils]: 44: Hoare triple {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,835 INFO L290 TraceCheckUtils]: 46: Hoare triple {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 08:59:51,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 08:59:51,838 INFO L290 TraceCheckUtils]: 52: Hoare triple {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 08:59:51,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11229#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {11229#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {11040#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {11040#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {11040#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 60: Hoare triple {11040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 63: Hoare triple {11040#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L272 TraceCheckUtils]: 64: Hoare triple {11040#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11040#false} is VALID [2022-04-08 08:59:51,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-08 08:59:51,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-08 08:59:51,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-08 08:59:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:51,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:52,228 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L272 TraceCheckUtils]: 64: Hoare triple {11040#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {11040#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {11040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 59: Hoare triple {11040#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {11040#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-08 08:59:52,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {11040#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11040#false} is VALID [2022-04-08 08:59:52,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {11311#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 08:59:52,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {11315#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11311#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {11315#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11315#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,232 INFO L290 TraceCheckUtils]: 51: Hoare triple {11315#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11315#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {11325#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11315#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {11325#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11325#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {11325#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11325#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,233 INFO L290 TraceCheckUtils]: 47: Hoare triple {11335#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11325#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {11335#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11335#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {11335#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11335#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {11345#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11335#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {11345#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11345#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {11345#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11345#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11345#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#(< (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#(< (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11365#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {11365#(< (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11365#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11365#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {11385#(< (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {11385#(< (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11385#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {11385#(< (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11385#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11385#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:52,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {11413#(<= 11 main_~edgecount~0)} ~i~0 := 0; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {11039#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 08:59:52,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-08 08:59:52,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-08 08:59:52,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-08 08:59:52,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-08 08:59:52,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11039#true} is VALID [2022-04-08 08:59:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:52,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327343236] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:52,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:52,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 36 [2022-04-08 08:59:52,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:52,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [477391190] [2022-04-08 08:59:52,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [477391190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:52,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:52,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:59:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038518418] [2022-04-08 08:59:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:52,248 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 08:59:52,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:52,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:52,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:52,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:59:52,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:52,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:59:52,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=746, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 08:59:52,296 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:52,878 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2022-04-08 08:59:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:59:52,878 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 08:59:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-04-08 08:59:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-04-08 08:59:52,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 105 transitions. [2022-04-08 08:59:52,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:52,995 INFO L225 Difference]: With dead ends: 127 [2022-04-08 08:59:52,995 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 08:59:52,996 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=816, Invalid=1440, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 08:59:52,996 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 158 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:52,997 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 55 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 08:59:53,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-04-08 08:59:53,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:53,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:53,127 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:53,127 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:53,128 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-08 08:59:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-04-08 08:59:53,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:53,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:53,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-04-08 08:59:53,128 INFO L87 Difference]: Start difference. First operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-04-08 08:59:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:53,129 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-08 08:59:53,129 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-04-08 08:59:53,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:53,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:53,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:53,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2022-04-08 08:59:53,133 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 68 [2022-04-08 08:59:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:53,133 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2022-04-08 08:59:53,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:53,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 92 transitions. [2022-04-08 08:59:53,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2022-04-08 08:59:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 08:59:53,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:53,250 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:53,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:53,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:53,451 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash 527091025, now seen corresponding path program 27 times [2022-04-08 08:59:53,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:53,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [716061720] [2022-04-08 08:59:53,454 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:53,455 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:53,455 INFO L85 PathProgramCache]: Analyzing trace with hash 527091025, now seen corresponding path program 28 times [2022-04-08 08:59:53,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:53,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278526419] [2022-04-08 08:59:53,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:53,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:53,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:53,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {12089#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-08 08:59:53,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-08 08:59:53,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-08 08:59:53,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12089#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:53,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {12089#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-08 08:59:53,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-08 08:59:53,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-08 08:59:53,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-08 08:59:53,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {12071#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {12076#(<= 20 main_~edgecount~0)} ~i~0 := 0; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:53,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:53,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:53,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:53,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12088#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {12088#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12072#false} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {12072#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12072#false} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {12072#false} assume !(~i~0 < ~nodecount~0); {12072#false} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {12072#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {12072#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {12072#false} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {12072#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {12072#false} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {12072#false} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-08 08:59:53,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {12072#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-08 08:59:53,621 INFO L272 TraceCheckUtils]: 67: Hoare triple {12072#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {12072#false} is VALID [2022-04-08 08:59:53,621 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-08 08:59:53,621 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-08 08:59:53,621 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-08 08:59:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 1 proven. 176 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:53,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:53,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278526419] [2022-04-08 08:59:53,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278526419] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:53,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546840333] [2022-04-08 08:59:53,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:59:53,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:53,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:53,636 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:53,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 08:59:53,751 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:59:53,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:53,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 08:59:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:53,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:54,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {12071#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {12071#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 08:59:54,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 08:59:54,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 08:59:54,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 08:59:54,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {12071#true} assume !(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {12071#true} ~i~0 := 0; {12071#true} is VALID [2022-04-08 08:59:54,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:54,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {12162#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:54,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {12162#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:54,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {12162#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12172#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:54,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {12172#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12172#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:54,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {12172#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12172#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:54,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {12172#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12182#(<= 2 main_~j~0)} is VALID [2022-04-08 08:59:54,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {12182#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12182#(<= 2 main_~j~0)} is VALID [2022-04-08 08:59:54,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {12182#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12182#(<= 2 main_~j~0)} is VALID [2022-04-08 08:59:54,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {12182#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12192#(<= 3 main_~j~0)} is VALID [2022-04-08 08:59:54,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {12192#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12192#(<= 3 main_~j~0)} is VALID [2022-04-08 08:59:54,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {12192#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12192#(<= 3 main_~j~0)} is VALID [2022-04-08 08:59:54,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {12192#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12202#(<= 4 main_~j~0)} is VALID [2022-04-08 08:59:54,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {12202#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12202#(<= 4 main_~j~0)} is VALID [2022-04-08 08:59:54,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {12202#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12202#(<= 4 main_~j~0)} is VALID [2022-04-08 08:59:54,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {12202#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12212#(<= 5 main_~j~0)} is VALID [2022-04-08 08:59:54,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {12212#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12212#(<= 5 main_~j~0)} is VALID [2022-04-08 08:59:54,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {12212#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12212#(<= 5 main_~j~0)} is VALID [2022-04-08 08:59:54,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {12212#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12222#(<= 6 main_~j~0)} is VALID [2022-04-08 08:59:54,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {12222#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12222#(<= 6 main_~j~0)} is VALID [2022-04-08 08:59:54,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {12222#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12222#(<= 6 main_~j~0)} is VALID [2022-04-08 08:59:54,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {12222#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12232#(<= 7 main_~j~0)} is VALID [2022-04-08 08:59:54,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {12232#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12232#(<= 7 main_~j~0)} is VALID [2022-04-08 08:59:54,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {12232#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12232#(<= 7 main_~j~0)} is VALID [2022-04-08 08:59:54,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {12232#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12242#(<= 8 main_~j~0)} is VALID [2022-04-08 08:59:54,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {12242#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12242#(<= 8 main_~j~0)} is VALID [2022-04-08 08:59:54,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {12242#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12242#(<= 8 main_~j~0)} is VALID [2022-04-08 08:59:54,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {12242#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12252#(<= 9 main_~j~0)} is VALID [2022-04-08 08:59:54,168 INFO L290 TraceCheckUtils]: 51: Hoare triple {12252#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12252#(<= 9 main_~j~0)} is VALID [2022-04-08 08:59:54,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {12252#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12252#(<= 9 main_~j~0)} is VALID [2022-04-08 08:59:54,168 INFO L290 TraceCheckUtils]: 53: Hoare triple {12252#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12262#(<= 10 main_~j~0)} is VALID [2022-04-08 08:59:54,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {12262#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,169 INFO L290 TraceCheckUtils]: 55: Hoare triple {12266#(< 10 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {12266#(< 10 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {12266#(< 10 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,170 INFO L290 TraceCheckUtils]: 58: Hoare triple {12266#(< 10 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,170 INFO L290 TraceCheckUtils]: 59: Hoare triple {12266#(< 10 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,170 INFO L290 TraceCheckUtils]: 60: Hoare triple {12266#(< 10 main_~edgecount~0)} ~i~0 := 0; {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 08:59:54,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 08:59:54,171 INFO L290 TraceCheckUtils]: 62: Hoare triple {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 08:59:54,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {12295#(and (< 10 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 08:59:54,172 INFO L290 TraceCheckUtils]: 64: Hoare triple {12295#(and (< 10 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-08 08:59:54,172 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-08 08:59:54,172 INFO L290 TraceCheckUtils]: 66: Hoare triple {12072#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-08 08:59:54,172 INFO L272 TraceCheckUtils]: 67: Hoare triple {12072#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {12072#false} is VALID [2022-04-08 08:59:54,172 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-08 08:59:54,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-08 08:59:54,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-08 08:59:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 146 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 08:59:54,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:54,540 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-08 08:59:54,540 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-08 08:59:54,540 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-08 08:59:54,540 INFO L272 TraceCheckUtils]: 67: Hoare triple {12072#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {12072#false} is VALID [2022-04-08 08:59:54,540 INFO L290 TraceCheckUtils]: 66: Hoare triple {12072#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-08 08:59:54,540 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-08 08:59:54,540 INFO L290 TraceCheckUtils]: 64: Hoare triple {12335#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-08 08:59:54,541 INFO L290 TraceCheckUtils]: 63: Hoare triple {12339#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {12335#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {12339#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {12339#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:54,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {12339#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12339#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:54,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {12349#(< 1 main_~edgecount~0)} ~i~0 := 0; {12339#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:54,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {12349#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {12349#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {12349#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,543 INFO L290 TraceCheckUtils]: 56: Hoare triple {12349#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,545 INFO L290 TraceCheckUtils]: 55: Hoare triple {12349#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {12172#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:54,546 INFO L290 TraceCheckUtils]: 53: Hoare triple {12162#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12172#(<= 1 main_~j~0)} is VALID [2022-04-08 08:59:54,546 INFO L290 TraceCheckUtils]: 52: Hoare triple {12162#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:54,546 INFO L290 TraceCheckUtils]: 51: Hoare triple {12162#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:54,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {12380#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 08:59:54,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {12380#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12380#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 08:59:54,547 INFO L290 TraceCheckUtils]: 48: Hoare triple {12380#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12380#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 08:59:54,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {12390#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12380#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 08:59:54,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {12390#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12390#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 08:59:54,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {12390#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12390#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 08:59:54,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {12400#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12390#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 08:59:54,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {12400#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12400#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 08:59:54,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {12400#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12400#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 08:59:54,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {12410#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12400#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 08:59:54,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {12410#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12410#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 08:59:54,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {12410#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12410#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 08:59:54,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {12420#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12410#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 08:59:54,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {12420#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12420#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 08:59:54,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {12420#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12420#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 08:59:54,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {12430#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12420#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 08:59:54,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {12430#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12430#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 08:59:54,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {12430#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12430#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 08:59:54,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {12440#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12430#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 08:59:54,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {12440#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12440#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 08:59:54,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {12440#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12440#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 08:59:54,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {12450#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12440#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 08:59:54,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {12450#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12450#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 08:59:54,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {12450#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12450#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 08:59:54,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {12460#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12450#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 08:59:54,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {12460#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12460#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 08:59:54,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {12460#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12460#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 08:59:54,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12460#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 08:59:54,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {12071#true} ~i~0 := 0; {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {12071#true} assume !(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {12071#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {12071#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {12071#true} is VALID [2022-04-08 08:59:54,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-08 08:59:54,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-08 08:59:54,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-08 08:59:54,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-08 08:59:54,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12071#true} is VALID [2022-04-08 08:59:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 146 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 08:59:54,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546840333] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:54,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:54,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-04-08 08:59:54,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:54,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [716061720] [2022-04-08 08:59:54,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [716061720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:54,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:54,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 08:59:54,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159168342] [2022-04-08 08:59:54,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:54,561 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-08 08:59:54,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:54,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:54,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:54,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 08:59:54,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 08:59:54,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1359, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 08:59:54,609 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:55,217 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2022-04-08 08:59:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 08:59:55,217 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-08 08:59:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-04-08 08:59:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-04-08 08:59:55,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 109 transitions. [2022-04-08 08:59:55,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:55,299 INFO L225 Difference]: With dead ends: 133 [2022-04-08 08:59:55,299 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 08:59:55,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=607, Invalid=2363, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 08:59:55,300 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 175 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:55,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 45 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 08:59:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-08 08:59:55,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:55,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:55,414 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:55,414 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:55,415 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2022-04-08 08:59:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-04-08 08:59:55,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:55,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:55,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 81 states. [2022-04-08 08:59:55,415 INFO L87 Difference]: Start difference. First operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 81 states. [2022-04-08 08:59:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:55,416 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2022-04-08 08:59:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-04-08 08:59:55,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:55,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:55,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:55,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2022-04-08 08:59:55,426 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 71 [2022-04-08 08:59:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:55,426 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2022-04-08 08:59:55,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 96 transitions. [2022-04-08 08:59:55,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2022-04-08 08:59:55,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 08:59:55,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:55,553 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:55,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:55,754 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:55,754 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:55,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:55,754 INFO L85 PathProgramCache]: Analyzing trace with hash 237238170, now seen corresponding path program 29 times [2022-04-08 08:59:55,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:55,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452697256] [2022-04-08 08:59:55,758 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:55,759 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 237238170, now seen corresponding path program 30 times [2022-04-08 08:59:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:55,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478872776] [2022-04-08 08:59:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:55,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:55,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {13172#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-08 08:59:55,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 08:59:55,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-08 08:59:55,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13172#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:55,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {13172#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-08 08:59:55,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 08:59:55,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-08 08:59:55,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-08 08:59:55,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 08:59:55,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:55,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:55,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:55,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:55,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:55,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:55,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:55,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:55,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:55,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:55,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:55,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:55,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 08:59:55,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 08:59:55,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 08:59:55,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,979 INFO L290 TraceCheckUtils]: 57: Hoare triple {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13171#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 60: Hoare triple {13171#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !(~j~0 < ~edgecount~0); {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {13154#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 62: Hoare triple {13154#false} assume !(~i~0 < ~nodecount~0); {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 63: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {13154#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {13154#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 66: Hoare triple {13154#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 67: Hoare triple {13154#false} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 69: Hoare triple {13154#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L272 TraceCheckUtils]: 70: Hoare triple {13154#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-08 08:59:55,980 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-08 08:59:55,981 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-08 08:59:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:55,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:55,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478872776] [2022-04-08 08:59:55,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478872776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:55,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561299788] [2022-04-08 08:59:55,981 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:59:55,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:55,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:55,982 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:55,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 08:59:56,107 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 08:59:56,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:56,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 08:59:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:56,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:56,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-08 08:59:56,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-08 08:59:56,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 08:59:56,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-08 08:59:56,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-08 08:59:56,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {13191#(<= 20 main_~edgecount~0)} ~i~0 := 0; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,371 INFO L290 TraceCheckUtils]: 57: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,372 INFO L290 TraceCheckUtils]: 59: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,373 INFO L290 TraceCheckUtils]: 62: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,373 INFO L290 TraceCheckUtils]: 63: Hoare triple {13191#(<= 20 main_~edgecount~0)} ~i~0 := 0; {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:56,373 INFO L290 TraceCheckUtils]: 64: Hoare triple {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:56,374 INFO L290 TraceCheckUtils]: 65: Hoare triple {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:56,374 INFO L290 TraceCheckUtils]: 66: Hoare triple {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13376#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:56,374 INFO L290 TraceCheckUtils]: 67: Hoare triple {13376#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-08 08:59:56,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-08 08:59:56,374 INFO L290 TraceCheckUtils]: 69: Hoare triple {13154#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-08 08:59:56,375 INFO L272 TraceCheckUtils]: 70: Hoare triple {13154#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13154#false} is VALID [2022-04-08 08:59:56,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-08 08:59:56,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-08 08:59:56,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-08 08:59:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-08 08:59:56,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:56,602 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-08 08:59:56,602 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-08 08:59:56,602 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-08 08:59:56,602 INFO L272 TraceCheckUtils]: 70: Hoare triple {13154#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13154#false} is VALID [2022-04-08 08:59:56,602 INFO L290 TraceCheckUtils]: 69: Hoare triple {13154#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-08 08:59:56,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-08 08:59:56,603 INFO L290 TraceCheckUtils]: 67: Hoare triple {13416#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-08 08:59:56,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {13420#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13416#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,604 INFO L290 TraceCheckUtils]: 65: Hoare triple {13420#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13420#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:56,604 INFO L290 TraceCheckUtils]: 64: Hoare triple {13420#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13420#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:56,605 INFO L290 TraceCheckUtils]: 63: Hoare triple {13430#(< 1 main_~edgecount~0)} ~i~0 := 0; {13420#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:56,605 INFO L290 TraceCheckUtils]: 62: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,605 INFO L290 TraceCheckUtils]: 61: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,608 INFO L290 TraceCheckUtils]: 50: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,609 INFO L290 TraceCheckUtils]: 48: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,609 INFO L290 TraceCheckUtils]: 47: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,609 INFO L290 TraceCheckUtils]: 46: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,610 INFO L290 TraceCheckUtils]: 45: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {13430#(< 1 main_~edgecount~0)} ~i~0 := 0; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {13430#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 08:59:56,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-08 08:59:56,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-08 08:59:56,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 08:59:56,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-08 08:59:56,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-08 08:59:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-08 08:59:56,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561299788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:56,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:56,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 23 [2022-04-08 08:59:56,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:56,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452697256] [2022-04-08 08:59:56,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452697256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:56,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:56,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 08:59:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506684067] [2022-04-08 08:59:56,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-08 08:59:56,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:56,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:56,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:56,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 08:59:56,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:56,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 08:59:56,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2022-04-08 08:59:56,702 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:57,376 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2022-04-08 08:59:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 08:59:57,376 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-08 08:59:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 113 transitions. [2022-04-08 08:59:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 113 transitions. [2022-04-08 08:59:57,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 113 transitions. [2022-04-08 08:59:57,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:57,462 INFO L225 Difference]: With dead ends: 139 [2022-04-08 08:59:57,462 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 08:59:57,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=439, Invalid=893, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 08:59:57,463 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:57,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 55 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:59:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 08:59:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-08 08:59:57,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:57,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:57,592 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:57,592 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:57,593 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-04-08 08:59:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-04-08 08:59:57,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:57,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:57,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 84 states. [2022-04-08 08:59:57,594 INFO L87 Difference]: Start difference. First operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 84 states. [2022-04-08 08:59:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:57,594 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-04-08 08:59:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-04-08 08:59:57,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:57,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:57,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:57,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-04-08 08:59:57,596 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 74 [2022-04-08 08:59:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:57,596 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-04-08 08:59:57,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:57,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 100 transitions. [2022-04-08 08:59:57,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-04-08 08:59:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 08:59:57,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:57,733 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:57,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:57,934 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:57,934 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1884900175, now seen corresponding path program 31 times [2022-04-08 08:59:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:57,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1964436677] [2022-04-08 08:59:57,938 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:57,938 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1884900175, now seen corresponding path program 32 times [2022-04-08 08:59:57,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:57,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949187912] [2022-04-08 08:59:57,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:58,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:58,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {14280#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-08 08:59:58,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-08 08:59:58,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-08 08:59:58,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14280#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:58,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {14280#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-08 08:59:58,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-08 08:59:58,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-08 08:59:58,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-08 08:59:58,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {14260#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {14265#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,137 INFO L290 TraceCheckUtils]: 41: Hoare triple {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,139 INFO L290 TraceCheckUtils]: 46: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,140 INFO L290 TraceCheckUtils]: 50: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,140 INFO L290 TraceCheckUtils]: 51: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,141 INFO L290 TraceCheckUtils]: 52: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,142 INFO L290 TraceCheckUtils]: 56: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,143 INFO L290 TraceCheckUtils]: 59: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,143 INFO L290 TraceCheckUtils]: 60: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 63: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 64: Hoare triple {14261#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 67: Hoare triple {14261#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 68: Hoare triple {14261#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 69: Hoare triple {14261#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {14261#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L272 TraceCheckUtils]: 73: Hoare triple {14261#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-08 08:59:58,145 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-08 08:59:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:58,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949187912] [2022-04-08 08:59:58,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949187912] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:58,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493466938] [2022-04-08 08:59:58,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:58,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:58,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:58,147 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:58,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 08:59:58,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:58,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:58,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 08:59:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:58,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:58,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14260#true} is VALID [2022-04-08 08:59:58,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {14260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-08 08:59:58,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-08 08:59:58,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-08 08:59:58,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-08 08:59:58,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {14260#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {14265#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 08:59:58,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:58,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:58,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:58,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:58,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:58,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:58,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:58,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:58,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:58,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:58,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:58,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:58,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:58,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:58,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:58,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 08:59:58,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 08:59:58,849 INFO L290 TraceCheckUtils]: 52: Hoare triple {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 08:59:58,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,851 INFO L290 TraceCheckUtils]: 55: Hoare triple {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,851 INFO L290 TraceCheckUtils]: 57: Hoare triple {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,853 INFO L290 TraceCheckUtils]: 60: Hoare triple {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14483#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {14483#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {14261#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {14261#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {14261#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 69: Hoare triple {14261#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 72: Hoare triple {14261#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L272 TraceCheckUtils]: 73: Hoare triple {14261#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-08 08:59:58,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-08 08:59:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:58,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:59,263 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-08 08:59:59,263 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-08 08:59:59,263 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-08 08:59:59,263 INFO L272 TraceCheckUtils]: 73: Hoare triple {14261#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {14261#false} is VALID [2022-04-08 08:59:59,263 INFO L290 TraceCheckUtils]: 72: Hoare triple {14261#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 08:59:59,264 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 08:59:59,264 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 08:59:59,264 INFO L290 TraceCheckUtils]: 69: Hoare triple {14261#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14261#false} is VALID [2022-04-08 08:59:59,264 INFO L290 TraceCheckUtils]: 68: Hoare triple {14261#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14261#false} is VALID [2022-04-08 08:59:59,264 INFO L290 TraceCheckUtils]: 67: Hoare triple {14261#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 08:59:59,264 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 08:59:59,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-08 08:59:59,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {14261#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14261#false} is VALID [2022-04-08 08:59:59,264 INFO L290 TraceCheckUtils]: 63: Hoare triple {14565#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 08:59:59,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {14569#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14565#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {14569#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14569#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {14569#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14569#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,265 INFO L290 TraceCheckUtils]: 59: Hoare triple {14579#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14569#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,266 INFO L290 TraceCheckUtils]: 58: Hoare triple {14579#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14579#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {14579#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14579#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {14589#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14579#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {14589#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14589#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {14589#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14589#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {14599#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14589#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,268 INFO L290 TraceCheckUtils]: 52: Hoare triple {14599#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14599#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {14599#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14599#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,269 INFO L290 TraceCheckUtils]: 50: Hoare triple {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14599#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,269 INFO L290 TraceCheckUtils]: 49: Hoare triple {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 08:59:59,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {14691#(<= 14 main_~edgecount~0)} ~i~0 := 0; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {14260#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 08:59:59,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-08 08:59:59,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-08 08:59:59,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-08 08:59:59,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {14260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-08 08:59:59,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14260#true} is VALID [2022-04-08 08:59:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 08:59:59,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493466938] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:59,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:59,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 39 [2022-04-08 08:59:59,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:59,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1964436677] [2022-04-08 08:59:59,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1964436677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:59,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:59,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 08:59:59,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849073775] [2022-04-08 08:59:59,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:59,284 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-08 08:59:59,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:59,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:59,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:59,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 08:59:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 08:59:59,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=589, Invalid=893, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 08:59:59,329 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:00,070 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2022-04-08 09:00:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 09:00:00,070 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-08 09:00:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-08 09:00:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-08 09:00:00,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2022-04-08 09:00:00,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:00,160 INFO L225 Difference]: With dead ends: 145 [2022-04-08 09:00:00,160 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 09:00:00,162 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=972, Invalid=1890, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 09:00:00,162 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:00,162 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 55 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:00:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 09:00:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-04-08 09:00:00,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:00,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:00,333 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:00,333 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:00,334 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-04-08 09:00:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-08 09:00:00,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:00,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:00,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-04-08 09:00:00,335 INFO L87 Difference]: Start difference. First operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-04-08 09:00:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:00,336 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-04-08 09:00:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-08 09:00:00,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:00,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:00,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:00,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2022-04-08 09:00:00,337 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 77 [2022-04-08 09:00:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:00,337 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2022-04-08 09:00:00,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:00,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 104 transitions. [2022-04-08 09:00:00,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-04-08 09:00:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 09:00:00,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:00,484 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:00,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:00,684 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:00,685 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash -589738950, now seen corresponding path program 33 times [2022-04-08 09:00:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:00,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383783483] [2022-04-08 09:00:00,688 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:00,688 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash -589738950, now seen corresponding path program 34 times [2022-04-08 09:00:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:00,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898939755] [2022-04-08 09:00:00,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:00,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:00,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {15448#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-08 09:00:00,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-08 09:00:00,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-08 09:00:00,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15448#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:00,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {15448#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-08 09:00:00,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-08 09:00:00,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-08 09:00:00,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-08 09:00:00,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {15427#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:00,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:00,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:00,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:00,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:00,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:00,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:00,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:00,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:00,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:00,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:00,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:00,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:00,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,959 INFO L290 TraceCheckUtils]: 49: Hoare triple {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:00,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:00,961 INFO L290 TraceCheckUtils]: 52: Hoare triple {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:00,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,962 INFO L290 TraceCheckUtils]: 55: Hoare triple {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,962 INFO L290 TraceCheckUtils]: 56: Hoare triple {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,963 INFO L290 TraceCheckUtils]: 59: Hoare triple {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,965 INFO L290 TraceCheckUtils]: 64: Hoare triple {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15447#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {15447#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !(~j~0 < ~edgecount~0); {15428#false} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 67: Hoare triple {15428#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15428#false} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 68: Hoare triple {15428#false} assume !(~i~0 < ~nodecount~0); {15428#false} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 69: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 70: Hoare triple {15428#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 71: Hoare triple {15428#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15428#false} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 72: Hoare triple {15428#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15428#false} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 73: Hoare triple {15428#false} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-08 09:00:00,966 INFO L290 TraceCheckUtils]: 75: Hoare triple {15428#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-08 09:00:00,967 INFO L272 TraceCheckUtils]: 76: Hoare triple {15428#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15428#false} is VALID [2022-04-08 09:00:00,967 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-08 09:00:00,967 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-08 09:00:00,967 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-08 09:00:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:00:00,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:00,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898939755] [2022-04-08 09:00:00,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898939755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:00,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363252714] [2022-04-08 09:00:00,967 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:00,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:00,968 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:00,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 09:00:01,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:01,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:01,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 09:00:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:01,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:01,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15427#true} is VALID [2022-04-08 09:00:01,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {15427#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {15427#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {15427#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:01,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 09:00:01,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 09:00:01,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {15427#true} assume !(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:01,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {15427#true} ~i~0 := 0; {15427#true} is VALID [2022-04-08 09:00:01,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:01,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {15521#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:01,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {15521#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:01,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {15521#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15531#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:01,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {15531#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15531#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:01,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {15531#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15531#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:01,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {15531#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15541#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:01,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {15541#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15541#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:01,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {15541#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15541#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:01,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {15541#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15551#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:01,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {15551#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15551#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:01,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {15551#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15551#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:01,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {15551#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15561#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:01,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {15561#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15561#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:01,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {15561#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15561#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:01,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {15561#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15571#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:01,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {15571#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15571#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:01,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {15571#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15571#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:01,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {15571#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15581#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:01,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {15581#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15581#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:01,536 INFO L290 TraceCheckUtils]: 43: Hoare triple {15581#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15581#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:01,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {15581#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15591#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:01,537 INFO L290 TraceCheckUtils]: 45: Hoare triple {15591#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15591#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:01,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {15591#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15591#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:01,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {15591#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15601#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:01,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {15601#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15601#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:01,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {15601#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15601#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:01,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {15601#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15611#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:01,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {15611#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15611#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:01,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {15611#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15611#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:01,539 INFO L290 TraceCheckUtils]: 53: Hoare triple {15611#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15621#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:01,539 INFO L290 TraceCheckUtils]: 54: Hoare triple {15621#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15621#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:01,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {15621#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15621#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:01,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {15621#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15631#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:01,540 INFO L290 TraceCheckUtils]: 57: Hoare triple {15631#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15631#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:01,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {15631#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15631#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:01,541 INFO L290 TraceCheckUtils]: 59: Hoare triple {15631#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15641#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:01,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {15641#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15641#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:01,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {15641#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15641#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:01,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {15641#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15651#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:01,542 INFO L290 TraceCheckUtils]: 63: Hoare triple {15651#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,542 INFO L290 TraceCheckUtils]: 64: Hoare triple {15655#(< 13 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,543 INFO L290 TraceCheckUtils]: 65: Hoare triple {15655#(< 13 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,543 INFO L290 TraceCheckUtils]: 66: Hoare triple {15655#(< 13 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {15655#(< 13 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {15655#(< 13 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,544 INFO L290 TraceCheckUtils]: 69: Hoare triple {15655#(< 13 main_~edgecount~0)} ~i~0 := 0; {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} is VALID [2022-04-08 09:00:01,544 INFO L290 TraceCheckUtils]: 70: Hoare triple {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} is VALID [2022-04-08 09:00:01,544 INFO L290 TraceCheckUtils]: 71: Hoare triple {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} is VALID [2022-04-08 09:00:01,545 INFO L290 TraceCheckUtils]: 72: Hoare triple {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15684#(and (<= main_~i~0 1) (< 13 main_~edgecount~0))} is VALID [2022-04-08 09:00:01,545 INFO L290 TraceCheckUtils]: 73: Hoare triple {15684#(and (<= main_~i~0 1) (< 13 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-08 09:00:01,545 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-08 09:00:01,545 INFO L290 TraceCheckUtils]: 75: Hoare triple {15428#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-08 09:00:01,545 INFO L272 TraceCheckUtils]: 76: Hoare triple {15428#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15428#false} is VALID [2022-04-08 09:00:01,545 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-08 09:00:01,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-08 09:00:01,545 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-08 09:00:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 248 proven. 41 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 09:00:01,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:01,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-08 09:00:01,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-08 09:00:01,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-08 09:00:01,973 INFO L272 TraceCheckUtils]: 76: Hoare triple {15428#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15428#false} is VALID [2022-04-08 09:00:01,973 INFO L290 TraceCheckUtils]: 75: Hoare triple {15428#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-08 09:00:01,973 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-08 09:00:01,974 INFO L290 TraceCheckUtils]: 73: Hoare triple {15724#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-08 09:00:01,974 INFO L290 TraceCheckUtils]: 72: Hoare triple {15728#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15724#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,974 INFO L290 TraceCheckUtils]: 71: Hoare triple {15728#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15728#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:01,974 INFO L290 TraceCheckUtils]: 70: Hoare triple {15728#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15728#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:01,975 INFO L290 TraceCheckUtils]: 69: Hoare triple {15738#(< 1 main_~edgecount~0)} ~i~0 := 0; {15728#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:01,975 INFO L290 TraceCheckUtils]: 68: Hoare triple {15738#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,975 INFO L290 TraceCheckUtils]: 67: Hoare triple {15738#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,976 INFO L290 TraceCheckUtils]: 66: Hoare triple {15738#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {15738#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {15738#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {15531#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:01,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {15521#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15531#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:01,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {15521#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:01,977 INFO L290 TraceCheckUtils]: 60: Hoare triple {15521#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:01,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {15769#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:01,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {15769#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15769#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:01,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {15769#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15769#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:01,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {15779#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15769#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:01,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {15779#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15779#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:01,979 INFO L290 TraceCheckUtils]: 54: Hoare triple {15779#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15779#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:01,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {15789#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15779#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:01,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {15789#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15789#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:01,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {15789#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15789#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:01,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {15799#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15789#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:01,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {15799#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15799#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:01,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {15799#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15799#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:01,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {15809#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15799#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:01,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {15809#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15809#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:01,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {15809#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15809#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:01,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {15819#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15809#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:01,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {15819#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15819#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:01,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {15819#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15819#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:01,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {15829#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15819#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:01,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {15829#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15829#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:01,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {15829#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15829#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:01,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {15839#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15829#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:01,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {15839#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15839#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:01,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {15839#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15839#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:01,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {15849#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15839#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:01,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {15849#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15849#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:01,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {15849#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15849#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:01,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {15859#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15849#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:01,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {15859#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15859#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:01,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {15859#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15859#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:02,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {15869#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15859#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:02,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {15869#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15869#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:02,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {15869#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15869#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:02,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {15879#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15869#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:02,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {15879#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15879#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:02,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {15879#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15879#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:02,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15879#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:02,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {15427#true} ~i~0 := 0; {15427#true} is VALID [2022-04-08 09:00:02,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {15427#true} assume !(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:02,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 09:00:02,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 09:00:02,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:02,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 09:00:02,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {15427#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {15427#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {15427#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-08 09:00:02,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15427#true} is VALID [2022-04-08 09:00:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 248 proven. 41 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 09:00:02,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363252714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:02,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:02,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2022-04-08 09:00:02,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:02,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383783483] [2022-04-08 09:00:02,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383783483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:02,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:02,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 09:00:02,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688410840] [2022-04-08 09:00:02,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:02,020 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 09:00:02,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:02,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:02,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:02,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 09:00:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:02,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 09:00:02,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=1950, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 09:00:02,071 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:02,825 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2022-04-08 09:00:02,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 09:00:02,825 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 09:00:02,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-04-08 09:00:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-04-08 09:00:02,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 121 transitions. [2022-04-08 09:00:02,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:02,928 INFO L225 Difference]: With dead ends: 151 [2022-04-08 09:00:02,928 INFO L226 Difference]: Without dead ends: 90 [2022-04-08 09:00:02,929 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=949, Invalid=3473, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 09:00:02,930 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 209 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:02,930 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 40 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-08 09:00:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-04-08 09:00:03,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:03,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:03,112 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:03,112 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:03,113 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-04-08 09:00:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-04-08 09:00:03,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:03,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:03,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 90 states. [2022-04-08 09:00:03,113 INFO L87 Difference]: Start difference. First operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 90 states. [2022-04-08 09:00:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:03,114 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-04-08 09:00:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-04-08 09:00:03,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:03,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:03,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:03,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2022-04-08 09:00:03,115 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 80 [2022-04-08 09:00:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:03,116 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2022-04-08 09:00:03,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:03,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 108 transitions. [2022-04-08 09:00:03,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-04-08 09:00:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 09:00:03,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:03,264 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:03,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:03,465 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:03,465 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1867095057, now seen corresponding path program 35 times [2022-04-08 09:00:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:03,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1659225552] [2022-04-08 09:00:03,469 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:03,469 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1867095057, now seen corresponding path program 36 times [2022-04-08 09:00:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:03,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687277292] [2022-04-08 09:00:03,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:03,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:03,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {16672#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-08 09:00:03,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-08 09:00:03,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-08 09:00:03,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16672#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:03,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {16672#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-08 09:00:03,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-08 09:00:03,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-08 09:00:03,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-08 09:00:03,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {16650#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {16655#(<= 20 main_~edgecount~0)} ~i~0 := 0; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:03,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:03,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:03,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:03,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,722 INFO L290 TraceCheckUtils]: 48: Hoare triple {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,723 INFO L290 TraceCheckUtils]: 51: Hoare triple {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,726 INFO L290 TraceCheckUtils]: 60: Hoare triple {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,726 INFO L290 TraceCheckUtils]: 61: Hoare triple {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,726 INFO L290 TraceCheckUtils]: 62: Hoare triple {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,727 INFO L290 TraceCheckUtils]: 63: Hoare triple {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,728 INFO L290 TraceCheckUtils]: 66: Hoare triple {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,728 INFO L290 TraceCheckUtils]: 67: Hoare triple {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 68: Hoare triple {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16671#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 69: Hoare triple {16671#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {16651#false} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 70: Hoare triple {16651#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16651#false} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 71: Hoare triple {16651#false} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 73: Hoare triple {16651#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {16651#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16651#false} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {16651#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16651#false} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 09:00:03,729 INFO L290 TraceCheckUtils]: 78: Hoare triple {16651#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 09:00:03,730 INFO L272 TraceCheckUtils]: 79: Hoare triple {16651#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16651#false} is VALID [2022-04-08 09:00:03,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-08 09:00:03,730 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-08 09:00:03,730 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-08 09:00:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 330 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:00:03,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:03,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687277292] [2022-04-08 09:00:03,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687277292] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:03,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331439426] [2022-04-08 09:00:03,730 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:00:03,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:03,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:03,731 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:03,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 09:00:03,896 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:00:03,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:03,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:00:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:03,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:04,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16650#true} is VALID [2022-04-08 09:00:04,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {16650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-08 09:00:04,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-08 09:00:04,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-08 09:00:04,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-08 09:00:04,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {16650#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {16691#(<= 5 main_~nodecount~0)} ~i~0 := 0; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,372 INFO L290 TraceCheckUtils]: 45: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,372 INFO L290 TraceCheckUtils]: 46: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,373 INFO L290 TraceCheckUtils]: 47: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,382 INFO L290 TraceCheckUtils]: 69: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16888#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {16888#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 73: Hoare triple {16651#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 74: Hoare triple {16651#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 75: Hoare triple {16651#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 78: Hoare triple {16651#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L272 TraceCheckUtils]: 79: Hoare triple {16651#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-08 09:00:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-08 09:00:04,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:04,676 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L272 TraceCheckUtils]: 79: Hoare triple {16651#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L290 TraceCheckUtils]: 78: Hoare triple {16651#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L290 TraceCheckUtils]: 75: Hoare triple {16651#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L290 TraceCheckUtils]: 74: Hoare triple {16651#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L290 TraceCheckUtils]: 73: Hoare triple {16651#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 09:00:04,677 INFO L290 TraceCheckUtils]: 71: Hoare triple {16958#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-08 09:00:04,678 INFO L290 TraceCheckUtils]: 70: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16958#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,678 INFO L290 TraceCheckUtils]: 69: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,678 INFO L290 TraceCheckUtils]: 68: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,678 INFO L290 TraceCheckUtils]: 67: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,679 INFO L290 TraceCheckUtils]: 66: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,679 INFO L290 TraceCheckUtils]: 65: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,679 INFO L290 TraceCheckUtils]: 64: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,679 INFO L290 TraceCheckUtils]: 63: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,680 INFO L290 TraceCheckUtils]: 58: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,681 INFO L290 TraceCheckUtils]: 55: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,682 INFO L290 TraceCheckUtils]: 53: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,682 INFO L290 TraceCheckUtils]: 52: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {17107#(< 1 main_~nodecount~0)} ~i~0 := 0; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:04,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {17107#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {16650#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 09:00:04,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-08 09:00:04,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-08 09:00:04,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-08 09:00:04,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {16650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-08 09:00:04,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16650#true} is VALID [2022-04-08 09:00:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-08 09:00:04,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331439426] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:04,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:04,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 5, 5] total 26 [2022-04-08 09:00:04,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:04,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1659225552] [2022-04-08 09:00:04,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1659225552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:04,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:04,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 09:00:04,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026919034] [2022-04-08 09:00:04,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:04,697 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 09:00:04,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:04,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:04,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:04,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 09:00:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:04,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 09:00:04,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2022-04-08 09:00:04,753 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:05,505 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2022-04-08 09:00:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 09:00:05,505 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 09:00:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2022-04-08 09:00:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2022-04-08 09:00:05,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 125 transitions. [2022-04-08 09:00:05,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:05,606 INFO L225 Difference]: With dead ends: 157 [2022-04-08 09:00:05,606 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 09:00:05,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=521, Invalid=1285, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 09:00:05,607 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 208 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:05,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 50 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 09:00:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-08 09:00:05,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:05,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:05,793 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:05,793 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:05,795 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-08 09:00:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-08 09:00:05,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:05,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:05,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-04-08 09:00:05,795 INFO L87 Difference]: Start difference. First operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-04-08 09:00:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:05,798 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-08 09:00:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-08 09:00:05,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:05,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:05,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:05,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-08 09:00:05,799 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 83 [2022-04-08 09:00:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:05,799 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-08 09:00:05,799 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:05,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-08 09:00:05,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-08 09:00:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 09:00:05,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:05,952 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:05,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:06,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 09:00:06,153 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:06,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:06,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1423660838, now seen corresponding path program 37 times [2022-04-08 09:00:06,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:06,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2138163554] [2022-04-08 09:00:06,156 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:06,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1423660838, now seen corresponding path program 38 times [2022-04-08 09:00:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:06,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533575015] [2022-04-08 09:00:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:06,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:06,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {17915#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-08 09:00:06,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 09:00:06,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-08 09:00:06,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17915#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:06,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {17915#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-08 09:00:06,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 09:00:06,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-08 09:00:06,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-08 09:00:06,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {17897#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:06,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:06,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:06,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:06,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,446 INFO L290 TraceCheckUtils]: 62: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,446 INFO L290 TraceCheckUtils]: 64: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,447 INFO L290 TraceCheckUtils]: 65: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,447 INFO L290 TraceCheckUtils]: 66: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,448 INFO L290 TraceCheckUtils]: 68: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,448 INFO L290 TraceCheckUtils]: 69: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,448 INFO L290 TraceCheckUtils]: 70: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,448 INFO L290 TraceCheckUtils]: 71: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 72: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 73: Hoare triple {17893#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 76: Hoare triple {17893#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 77: Hoare triple {17893#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 78: Hoare triple {17893#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 81: Hoare triple {17893#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L272 TraceCheckUtils]: 82: Hoare triple {17893#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-08 09:00:06,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-08 09:00:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:00:06,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:06,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533575015] [2022-04-08 09:00:06,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533575015] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:06,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497115390] [2022-04-08 09:00:06,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:06,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:06,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:06,451 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:06,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 09:00:06,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:06,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:06,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 09:00:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:06,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:07,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-08 09:00:07,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-08 09:00:07,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 09:00:07,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-08 09:00:07,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-08 09:00:07,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {17897#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 09:00:07,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 09:00:07,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 09:00:07,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:07,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:07,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:07,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:07,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:07,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:07,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:07,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:07,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:07,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:07,290 INFO L290 TraceCheckUtils]: 39: Hoare triple {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:07,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:07,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,291 INFO L290 TraceCheckUtils]: 42: Hoare triple {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,292 INFO L290 TraceCheckUtils]: 44: Hoare triple {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,293 INFO L290 TraceCheckUtils]: 46: Hoare triple {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,293 INFO L290 TraceCheckUtils]: 47: Hoare triple {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,295 INFO L290 TraceCheckUtils]: 50: Hoare triple {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:07,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:07,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:07,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,296 INFO L290 TraceCheckUtils]: 54: Hoare triple {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,298 INFO L290 TraceCheckUtils]: 58: Hoare triple {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,298 INFO L290 TraceCheckUtils]: 59: Hoare triple {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,298 INFO L290 TraceCheckUtils]: 60: Hoare triple {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,299 INFO L290 TraceCheckUtils]: 61: Hoare triple {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,299 INFO L290 TraceCheckUtils]: 62: Hoare triple {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,300 INFO L290 TraceCheckUtils]: 64: Hoare triple {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,300 INFO L290 TraceCheckUtils]: 65: Hoare triple {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,301 INFO L290 TraceCheckUtils]: 66: Hoare triple {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,301 INFO L290 TraceCheckUtils]: 67: Hoare triple {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,301 INFO L290 TraceCheckUtils]: 68: Hoare triple {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,302 INFO L290 TraceCheckUtils]: 69: Hoare triple {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,302 INFO L290 TraceCheckUtils]: 70: Hoare triple {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 71: Hoare triple {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18148#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 72: Hoare triple {18148#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} assume !(~j~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 73: Hoare triple {17893#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17893#false} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 76: Hoare triple {17893#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 77: Hoare triple {17893#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17893#false} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 78: Hoare triple {17893#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17893#false} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 09:00:07,303 INFO L290 TraceCheckUtils]: 81: Hoare triple {17893#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 09:00:07,304 INFO L272 TraceCheckUtils]: 82: Hoare triple {17893#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17893#false} is VALID [2022-04-08 09:00:07,304 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-08 09:00:07,304 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-08 09:00:07,304 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-08 09:00:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:00:07,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L272 TraceCheckUtils]: 82: Hoare triple {17893#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 81: Hoare triple {17893#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 78: Hoare triple {17893#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 77: Hoare triple {17893#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 76: Hoare triple {17893#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-08 09:00:07,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {17893#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17893#false} is VALID [2022-04-08 09:00:07,735 INFO L290 TraceCheckUtils]: 72: Hoare triple {18230#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 09:00:07,735 INFO L290 TraceCheckUtils]: 71: Hoare triple {18234#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18230#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,736 INFO L290 TraceCheckUtils]: 70: Hoare triple {18234#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18234#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,736 INFO L290 TraceCheckUtils]: 69: Hoare triple {18234#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18234#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {18244#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18234#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,737 INFO L290 TraceCheckUtils]: 67: Hoare triple {18244#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18244#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,738 INFO L290 TraceCheckUtils]: 66: Hoare triple {18244#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18244#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,738 INFO L290 TraceCheckUtils]: 65: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18244#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,739 INFO L290 TraceCheckUtils]: 63: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,739 INFO L290 TraceCheckUtils]: 62: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,740 INFO L290 TraceCheckUtils]: 61: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,740 INFO L290 TraceCheckUtils]: 60: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,741 INFO L290 TraceCheckUtils]: 59: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:07,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {18380#(<= 17 main_~edgecount~0)} ~i~0 := 0; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 09:00:07,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-08 09:00:07,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-08 09:00:07,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 09:00:07,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-08 09:00:07,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-08 09:00:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:00:07,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497115390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:07,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:07,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-04-08 09:00:07,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:07,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2138163554] [2022-04-08 09:00:07,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2138163554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:07,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:07,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 09:00:07,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32699882] [2022-04-08 09:00:07,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:07,761 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-08 09:00:07,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:07,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:07,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:07,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 09:00:07,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 09:00:07,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=1058, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 09:00:07,815 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:08,618 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2022-04-08 09:00:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 09:00:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-08 09:00:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 129 transitions. [2022-04-08 09:00:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 129 transitions. [2022-04-08 09:00:08,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 129 transitions. [2022-04-08 09:00:08,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:08,724 INFO L225 Difference]: With dead ends: 163 [2022-04-08 09:00:08,724 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 09:00:08,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=2412, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 09:00:08,725 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 233 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:08,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 40 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 09:00:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-04-08 09:00:08,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:08,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:08,919 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:08,919 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:08,921 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-04-08 09:00:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-04-08 09:00:08,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:08,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:08,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 96 states. [2022-04-08 09:00:08,921 INFO L87 Difference]: Start difference. First operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 96 states. [2022-04-08 09:00:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:08,923 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-04-08 09:00:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-04-08 09:00:08,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:08,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:08,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:08,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-08 09:00:08,925 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 86 [2022-04-08 09:00:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:08,925 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-08 09:00:08,925 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:08,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-08 09:00:09,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 09:00:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 09:00:09,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:09,084 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 17, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:09,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-08 09:00:09,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 09:00:09,295 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash 590969713, now seen corresponding path program 39 times [2022-04-08 09:00:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:09,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057347994] [2022-04-08 09:00:09,299 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:09,299 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:09,299 INFO L85 PathProgramCache]: Analyzing trace with hash 590969713, now seen corresponding path program 40 times [2022-04-08 09:00:09,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:09,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383424390] [2022-04-08 09:00:09,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:09,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:09,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:09,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {19218#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-08 09:00:09,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-08 09:00:09,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-08 09:00:09,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19218#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:09,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {19218#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-08 09:00:09,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-08 09:00:09,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-08 09:00:09,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-08 09:00:09,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {19194#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:09,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:09,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:09,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:09,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:09,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:09,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:09,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:09,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:09,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:09,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:09,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:09,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:09,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,613 INFO L290 TraceCheckUtils]: 43: Hoare triple {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,614 INFO L290 TraceCheckUtils]: 46: Hoare triple {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:09,616 INFO L290 TraceCheckUtils]: 51: Hoare triple {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:09,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:09,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,621 INFO L290 TraceCheckUtils]: 64: Hoare triple {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,623 INFO L290 TraceCheckUtils]: 65: Hoare triple {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,623 INFO L290 TraceCheckUtils]: 66: Hoare triple {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,624 INFO L290 TraceCheckUtils]: 67: Hoare triple {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,624 INFO L290 TraceCheckUtils]: 68: Hoare triple {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,625 INFO L290 TraceCheckUtils]: 70: Hoare triple {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:09,625 INFO L290 TraceCheckUtils]: 71: Hoare triple {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:09,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:09,626 INFO L290 TraceCheckUtils]: 73: Hoare triple {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:09,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19217#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 09:00:09,627 INFO L290 TraceCheckUtils]: 75: Hoare triple {19217#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume !(~j~0 < ~edgecount~0); {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 76: Hoare triple {19195#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 77: Hoare triple {19195#false} assume !(~i~0 < ~nodecount~0); {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 78: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 79: Hoare triple {19195#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 80: Hoare triple {19195#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 81: Hoare triple {19195#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 82: Hoare triple {19195#false} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 84: Hoare triple {19195#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L272 TraceCheckUtils]: 85: Hoare triple {19195#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-08 09:00:09,628 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-08 09:00:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 1 proven. 425 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:00:09,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:09,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383424390] [2022-04-08 09:00:09,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383424390] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:09,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699543808] [2022-04-08 09:00:09,629 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:09,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:09,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:09,630 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:09,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 09:00:09,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:09,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:09,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 09:00:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:09,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:10,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19194#true} is VALID [2022-04-08 09:00:10,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {19194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-08 09:00:10,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-08 09:00:10,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-08 09:00:10,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {19194#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {19194#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {19194#true} assume !(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {19194#true} ~i~0 := 0; {19194#true} is VALID [2022-04-08 09:00:10,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:10,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {19291#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:10,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {19291#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:10,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {19291#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19301#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:10,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {19301#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19301#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:10,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {19301#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19301#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:10,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {19301#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19311#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:10,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {19311#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19311#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:10,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {19311#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19311#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:10,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {19311#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19321#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:10,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {19321#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19321#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:10,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {19321#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19321#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:10,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {19321#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19331#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:10,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {19331#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19331#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:10,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {19331#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19331#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:10,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {19331#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19341#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:10,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {19341#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19341#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:10,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {19341#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19341#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:10,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {19341#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19351#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:10,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {19351#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19351#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:10,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {19351#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19351#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:10,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {19351#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19361#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:10,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {19361#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19361#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:10,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {19361#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19361#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:10,287 INFO L290 TraceCheckUtils]: 47: Hoare triple {19361#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19371#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:10,288 INFO L290 TraceCheckUtils]: 48: Hoare triple {19371#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19371#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:10,288 INFO L290 TraceCheckUtils]: 49: Hoare triple {19371#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19371#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:10,288 INFO L290 TraceCheckUtils]: 50: Hoare triple {19371#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19381#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:10,288 INFO L290 TraceCheckUtils]: 51: Hoare triple {19381#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19381#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:10,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {19381#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19381#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:10,289 INFO L290 TraceCheckUtils]: 53: Hoare triple {19381#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19391#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:10,289 INFO L290 TraceCheckUtils]: 54: Hoare triple {19391#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19391#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:10,290 INFO L290 TraceCheckUtils]: 55: Hoare triple {19391#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19391#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:10,290 INFO L290 TraceCheckUtils]: 56: Hoare triple {19391#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19401#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:10,290 INFO L290 TraceCheckUtils]: 57: Hoare triple {19401#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19401#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:10,290 INFO L290 TraceCheckUtils]: 58: Hoare triple {19401#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19401#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:10,291 INFO L290 TraceCheckUtils]: 59: Hoare triple {19401#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19411#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:10,291 INFO L290 TraceCheckUtils]: 60: Hoare triple {19411#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19411#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:10,291 INFO L290 TraceCheckUtils]: 61: Hoare triple {19411#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19411#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:10,292 INFO L290 TraceCheckUtils]: 62: Hoare triple {19411#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19421#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:10,292 INFO L290 TraceCheckUtils]: 63: Hoare triple {19421#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19421#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:10,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {19421#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19421#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:10,292 INFO L290 TraceCheckUtils]: 65: Hoare triple {19421#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19431#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:10,293 INFO L290 TraceCheckUtils]: 66: Hoare triple {19431#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19431#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:10,293 INFO L290 TraceCheckUtils]: 67: Hoare triple {19431#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19431#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:10,293 INFO L290 TraceCheckUtils]: 68: Hoare triple {19431#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19441#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:10,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {19441#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19441#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:10,294 INFO L290 TraceCheckUtils]: 70: Hoare triple {19441#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19441#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:10,294 INFO L290 TraceCheckUtils]: 71: Hoare triple {19441#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19451#(<= 16 main_~j~0)} is VALID [2022-04-08 09:00:10,295 INFO L290 TraceCheckUtils]: 72: Hoare triple {19451#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,295 INFO L290 TraceCheckUtils]: 73: Hoare triple {19455#(< 16 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,295 INFO L290 TraceCheckUtils]: 74: Hoare triple {19455#(< 16 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,295 INFO L290 TraceCheckUtils]: 75: Hoare triple {19455#(< 16 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,295 INFO L290 TraceCheckUtils]: 76: Hoare triple {19455#(< 16 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,296 INFO L290 TraceCheckUtils]: 77: Hoare triple {19455#(< 16 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,296 INFO L290 TraceCheckUtils]: 78: Hoare triple {19455#(< 16 main_~edgecount~0)} ~i~0 := 0; {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 09:00:10,296 INFO L290 TraceCheckUtils]: 79: Hoare triple {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 09:00:10,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 09:00:10,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {19484#(and (< 16 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:00:10,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {19484#(and (< 16 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-08 09:00:10,297 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-08 09:00:10,298 INFO L290 TraceCheckUtils]: 84: Hoare triple {19195#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-08 09:00:10,298 INFO L272 TraceCheckUtils]: 85: Hoare triple {19195#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {19195#false} is VALID [2022-04-08 09:00:10,298 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-08 09:00:10,298 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-08 09:00:10,298 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-08 09:00:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 377 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 09:00:10,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:10,768 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-08 09:00:10,768 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-08 09:00:10,768 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-08 09:00:10,769 INFO L272 TraceCheckUtils]: 85: Hoare triple {19195#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {19195#false} is VALID [2022-04-08 09:00:10,769 INFO L290 TraceCheckUtils]: 84: Hoare triple {19195#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-08 09:00:10,769 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-08 09:00:10,769 INFO L290 TraceCheckUtils]: 82: Hoare triple {19524#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-08 09:00:10,769 INFO L290 TraceCheckUtils]: 81: Hoare triple {19528#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {19524#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,770 INFO L290 TraceCheckUtils]: 80: Hoare triple {19528#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {19528#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:10,770 INFO L290 TraceCheckUtils]: 79: Hoare triple {19528#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {19528#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:10,770 INFO L290 TraceCheckUtils]: 78: Hoare triple {19538#(< 1 main_~edgecount~0)} ~i~0 := 0; {19528#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:10,770 INFO L290 TraceCheckUtils]: 77: Hoare triple {19538#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,771 INFO L290 TraceCheckUtils]: 76: Hoare triple {19538#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,771 INFO L290 TraceCheckUtils]: 75: Hoare triple {19538#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,771 INFO L290 TraceCheckUtils]: 74: Hoare triple {19538#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,771 INFO L290 TraceCheckUtils]: 73: Hoare triple {19538#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {19301#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:10,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {19291#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19301#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:10,772 INFO L290 TraceCheckUtils]: 70: Hoare triple {19291#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:10,773 INFO L290 TraceCheckUtils]: 69: Hoare triple {19291#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:10,773 INFO L290 TraceCheckUtils]: 68: Hoare triple {19569#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:10,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {19569#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19569#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:10,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {19569#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19569#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:10,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {19579#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19569#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:10,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {19579#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19579#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:10,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {19579#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19579#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:10,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {19589#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19579#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:10,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {19589#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19589#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:10,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {19589#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19589#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:10,776 INFO L290 TraceCheckUtils]: 59: Hoare triple {19599#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19589#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:10,776 INFO L290 TraceCheckUtils]: 58: Hoare triple {19599#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19599#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:10,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {19599#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19599#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:10,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {19609#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19599#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:10,777 INFO L290 TraceCheckUtils]: 55: Hoare triple {19609#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19609#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:10,777 INFO L290 TraceCheckUtils]: 54: Hoare triple {19609#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19609#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:10,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {19619#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19609#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:10,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {19619#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19619#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:10,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {19619#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19619#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:10,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {19629#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19619#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:10,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {19629#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19629#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:10,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {19629#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19629#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:10,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {19639#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19629#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:10,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {19639#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19639#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:10,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {19639#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19639#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:10,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {19649#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19639#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:10,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {19649#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19649#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:10,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {19649#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19649#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:10,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {19659#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19649#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:10,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {19659#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19659#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:10,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {19659#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19659#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:10,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {19669#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19659#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:10,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {19669#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19669#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:10,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {19669#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19669#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:10,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {19679#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19669#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:10,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {19679#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19679#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:10,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {19679#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19679#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:10,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {19689#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19679#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:10,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {19689#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19689#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:00:10,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {19689#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19689#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:00:10,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {19699#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19689#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:00:10,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {19699#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19699#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:00:10,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {19699#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19699#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:00:10,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {19709#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19699#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:00:10,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {19709#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19709#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:00:10,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {19709#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19709#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {19709#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {19194#true} ~i~0 := 0; {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {19194#true} assume !(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 09:00:10,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 09:00:10,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {19194#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 09:00:10,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 09:00:10,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {19194#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {19194#true} is VALID [2022-04-08 09:00:10,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-08 09:00:10,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-08 09:00:10,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-08 09:00:10,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {19194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-08 09:00:10,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19194#true} is VALID [2022-04-08 09:00:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 377 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 09:00:10,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699543808] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:10,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:10,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 60 [2022-04-08 09:00:10,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:10,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1057347994] [2022-04-08 09:00:10,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1057347994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:10,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:10,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 09:00:10,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122773281] [2022-04-08 09:00:10,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-08 09:00:10,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:10,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:10,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:10,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 09:00:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 09:00:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=849, Invalid=2691, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 09:00:10,860 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:11,912 INFO L93 Difference]: Finished difference Result 169 states and 214 transitions. [2022-04-08 09:00:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 09:00:11,913 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-08 09:00:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 133 transitions. [2022-04-08 09:00:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 133 transitions. [2022-04-08 09:00:11,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 133 transitions. [2022-04-08 09:00:12,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:12,023 INFO L225 Difference]: With dead ends: 169 [2022-04-08 09:00:12,023 INFO L226 Difference]: Without dead ends: 99 [2022-04-08 09:00:12,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1321, Invalid=4841, Unknown=0, NotChecked=0, Total=6162 [2022-04-08 09:00:12,025 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 176 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:12,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 70 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:00:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-08 09:00:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-04-08 09:00:12,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:12,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:12,233 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:12,234 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:12,235 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-04-08 09:00:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-04-08 09:00:12,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:12,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:12,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 99 states. [2022-04-08 09:00:12,235 INFO L87 Difference]: Start difference. First operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 99 states. [2022-04-08 09:00:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:12,237 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-04-08 09:00:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-04-08 09:00:12,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:12,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:12,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:12,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2022-04-08 09:00:12,238 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 89 [2022-04-08 09:00:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:12,238 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2022-04-08 09:00:12,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 120 transitions. [2022-04-08 09:00:12,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2022-04-08 09:00:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 09:00:12,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:12,404 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 18, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:12,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-08 09:00:12,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 09:00:12,605 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:12,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash 576720250, now seen corresponding path program 41 times [2022-04-08 09:00:12,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:12,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877411439] [2022-04-08 09:00:12,608 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:12,608 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash 576720250, now seen corresponding path program 42 times [2022-04-08 09:00:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:12,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113440025] [2022-04-08 09:00:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:12,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:12,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {20583#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-08 09:00:12,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-08 09:00:12,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-08 09:00:12,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20583#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:12,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {20583#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-08 09:00:12,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-08 09:00:12,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-08 09:00:12,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-08 09:00:12,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {20558#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:12,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:12,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:12,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:12,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:12,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:12,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:12,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:12,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:12,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:12,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:12,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:12,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:12,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:12,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:12,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:12,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,950 INFO L290 TraceCheckUtils]: 54: Hoare triple {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,950 INFO L290 TraceCheckUtils]: 55: Hoare triple {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,952 INFO L290 TraceCheckUtils]: 59: Hoare triple {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,952 INFO L290 TraceCheckUtils]: 60: Hoare triple {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,954 INFO L290 TraceCheckUtils]: 64: Hoare triple {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,954 INFO L290 TraceCheckUtils]: 65: Hoare triple {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,955 INFO L290 TraceCheckUtils]: 66: Hoare triple {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,955 INFO L290 TraceCheckUtils]: 67: Hoare triple {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,955 INFO L290 TraceCheckUtils]: 68: Hoare triple {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,956 INFO L290 TraceCheckUtils]: 69: Hoare triple {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,956 INFO L290 TraceCheckUtils]: 70: Hoare triple {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:12,957 INFO L290 TraceCheckUtils]: 71: Hoare triple {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:12,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:12,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:12,958 INFO L290 TraceCheckUtils]: 74: Hoare triple {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 09:00:12,958 INFO L290 TraceCheckUtils]: 75: Hoare triple {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 09:00:12,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 09:00:12,970 INFO L290 TraceCheckUtils]: 77: Hoare triple {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20582#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-08 09:00:12,970 INFO L290 TraceCheckUtils]: 78: Hoare triple {20582#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} assume !(~j~0 < ~edgecount~0); {20559#false} is VALID [2022-04-08 09:00:12,970 INFO L290 TraceCheckUtils]: 79: Hoare triple {20559#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {20559#false} is VALID [2022-04-08 09:00:12,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {20559#false} assume !(~i~0 < ~nodecount~0); {20559#false} is VALID [2022-04-08 09:00:12,970 INFO L290 TraceCheckUtils]: 81: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-08 09:00:12,970 INFO L290 TraceCheckUtils]: 82: Hoare triple {20559#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-08 09:00:12,971 INFO L290 TraceCheckUtils]: 83: Hoare triple {20559#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {20559#false} is VALID [2022-04-08 09:00:12,971 INFO L290 TraceCheckUtils]: 84: Hoare triple {20559#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20559#false} is VALID [2022-04-08 09:00:12,971 INFO L290 TraceCheckUtils]: 85: Hoare triple {20559#false} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-08 09:00:12,971 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-08 09:00:12,971 INFO L290 TraceCheckUtils]: 87: Hoare triple {20559#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-08 09:00:12,971 INFO L272 TraceCheckUtils]: 88: Hoare triple {20559#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {20559#false} is VALID [2022-04-08 09:00:12,971 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-08 09:00:12,971 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-08 09:00:12,971 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-08 09:00:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 1 proven. 477 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:00:12,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:12,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113440025] [2022-04-08 09:00:12,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113440025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:12,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78989586] [2022-04-08 09:00:12,972 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:00:12,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:12,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:12,973 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:12,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 09:00:13,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:00:13,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:13,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:00:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:13,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:13,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20558#true} is VALID [2022-04-08 09:00:13,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {20558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-08 09:00:13,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-08 09:00:13,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-08 09:00:13,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-08 09:00:13,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {20558#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {20602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,438 INFO L290 TraceCheckUtils]: 44: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,438 INFO L290 TraceCheckUtils]: 45: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,439 INFO L290 TraceCheckUtils]: 46: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,440 INFO L290 TraceCheckUtils]: 53: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,440 INFO L290 TraceCheckUtils]: 54: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,441 INFO L290 TraceCheckUtils]: 55: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,441 INFO L290 TraceCheckUtils]: 56: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,441 INFO L290 TraceCheckUtils]: 57: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,441 INFO L290 TraceCheckUtils]: 58: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,442 INFO L290 TraceCheckUtils]: 59: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,442 INFO L290 TraceCheckUtils]: 60: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,442 INFO L290 TraceCheckUtils]: 61: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,442 INFO L290 TraceCheckUtils]: 62: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,443 INFO L290 TraceCheckUtils]: 63: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,443 INFO L290 TraceCheckUtils]: 64: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,443 INFO L290 TraceCheckUtils]: 65: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,443 INFO L290 TraceCheckUtils]: 66: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,444 INFO L290 TraceCheckUtils]: 67: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,444 INFO L290 TraceCheckUtils]: 69: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,444 INFO L290 TraceCheckUtils]: 70: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,445 INFO L290 TraceCheckUtils]: 71: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,445 INFO L290 TraceCheckUtils]: 72: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,445 INFO L290 TraceCheckUtils]: 73: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,445 INFO L290 TraceCheckUtils]: 74: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,446 INFO L290 TraceCheckUtils]: 75: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,446 INFO L290 TraceCheckUtils]: 76: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,446 INFO L290 TraceCheckUtils]: 77: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,446 INFO L290 TraceCheckUtils]: 78: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,447 INFO L290 TraceCheckUtils]: 79: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,447 INFO L290 TraceCheckUtils]: 80: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,447 INFO L290 TraceCheckUtils]: 81: Hoare triple {20602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:13,448 INFO L290 TraceCheckUtils]: 82: Hoare triple {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:13,448 INFO L290 TraceCheckUtils]: 83: Hoare triple {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:13,449 INFO L290 TraceCheckUtils]: 84: Hoare triple {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20841#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:13,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {20841#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-08 09:00:13,449 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-08 09:00:13,449 INFO L290 TraceCheckUtils]: 87: Hoare triple {20559#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-08 09:00:13,449 INFO L272 TraceCheckUtils]: 88: Hoare triple {20559#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {20559#false} is VALID [2022-04-08 09:00:13,449 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-08 09:00:13,449 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-08 09:00:13,449 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-08 09:00:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2022-04-08 09:00:13,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:13,725 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-08 09:00:13,725 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-08 09:00:13,725 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-08 09:00:13,726 INFO L272 TraceCheckUtils]: 88: Hoare triple {20559#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {20559#false} is VALID [2022-04-08 09:00:13,726 INFO L290 TraceCheckUtils]: 87: Hoare triple {20559#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-08 09:00:13,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-08 09:00:13,726 INFO L290 TraceCheckUtils]: 85: Hoare triple {20881#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-08 09:00:13,726 INFO L290 TraceCheckUtils]: 84: Hoare triple {20885#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20881#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,727 INFO L290 TraceCheckUtils]: 83: Hoare triple {20885#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {20885#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:13,727 INFO L290 TraceCheckUtils]: 82: Hoare triple {20885#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {20885#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:13,727 INFO L290 TraceCheckUtils]: 81: Hoare triple {20895#(< 1 main_~edgecount~0)} ~i~0 := 0; {20885#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:13,728 INFO L290 TraceCheckUtils]: 80: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,728 INFO L290 TraceCheckUtils]: 79: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,728 INFO L290 TraceCheckUtils]: 78: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,728 INFO L290 TraceCheckUtils]: 77: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,729 INFO L290 TraceCheckUtils]: 73: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,730 INFO L290 TraceCheckUtils]: 72: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,730 INFO L290 TraceCheckUtils]: 70: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,731 INFO L290 TraceCheckUtils]: 67: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,731 INFO L290 TraceCheckUtils]: 66: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,732 INFO L290 TraceCheckUtils]: 64: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,733 INFO L290 TraceCheckUtils]: 59: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,737 INFO L290 TraceCheckUtils]: 47: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,737 INFO L290 TraceCheckUtils]: 46: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {20895#(< 1 main_~edgecount~0)} ~i~0 := 0; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {20895#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {20558#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:13,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-08 09:00:13,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-08 09:00:13,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-08 09:00:13,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {20558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-08 09:00:13,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20558#true} is VALID [2022-04-08 09:00:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2022-04-08 09:00:13,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78989586] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:13,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:13,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 5] total 29 [2022-04-08 09:00:13,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:13,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877411439] [2022-04-08 09:00:13,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877411439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:13,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:13,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 09:00:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028879493] [2022-04-08 09:00:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:13,751 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-08 09:00:13,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:13,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:13,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:13,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 09:00:13,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:13,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 09:00:13,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=516, Unknown=0, NotChecked=0, Total=812 [2022-04-08 09:00:13,806 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:14,677 INFO L93 Difference]: Finished difference Result 175 states and 222 transitions. [2022-04-08 09:00:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 09:00:14,677 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-08 09:00:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2022-04-08 09:00:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2022-04-08 09:00:14,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 137 transitions. [2022-04-08 09:00:14,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:14,783 INFO L225 Difference]: With dead ends: 175 [2022-04-08 09:00:14,783 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 09:00:14,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1556, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 09:00:14,784 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 200 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:14,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 45 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 09:00:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2022-04-08 09:00:15,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:15,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:15,017 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:15,017 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:15,018 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-04-08 09:00:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2022-04-08 09:00:15,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:15,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:15,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-04-08 09:00:15,019 INFO L87 Difference]: Start difference. First operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-04-08 09:00:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:15,019 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-04-08 09:00:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2022-04-08 09:00:15,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:15,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:15,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:15,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:15,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2022-04-08 09:00:15,021 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 92 [2022-04-08 09:00:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:15,021 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2022-04-08 09:00:15,021 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:15,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 124 transitions. [2022-04-08 09:00:15,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-08 09:00:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 09:00:15,209 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:15,209 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 19, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:15,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:15,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:15,428 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1272730321, now seen corresponding path program 43 times [2022-04-08 09:00:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1692988985] [2022-04-08 09:00:15,430 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:15,431 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:15,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1272730321, now seen corresponding path program 44 times [2022-04-08 09:00:15,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:15,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282439991] [2022-04-08 09:00:15,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:15,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:15,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:15,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {21961#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-08 09:00:15,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-08 09:00:15,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-08 09:00:15,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21961#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:15,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {21961#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-08 09:00:15,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-08 09:00:15,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-08 09:00:15,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-08 09:00:15,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {21935#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:15,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:15,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:15,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:15,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:15,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:15,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:15,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:15,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:15,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:15,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:15,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:15,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:15,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:15,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:15,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:15,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,782 INFO L290 TraceCheckUtils]: 55: Hoare triple {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,782 INFO L290 TraceCheckUtils]: 57: Hoare triple {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,783 INFO L290 TraceCheckUtils]: 59: Hoare triple {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,784 INFO L290 TraceCheckUtils]: 61: Hoare triple {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,784 INFO L290 TraceCheckUtils]: 62: Hoare triple {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,785 INFO L290 TraceCheckUtils]: 64: Hoare triple {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,786 INFO L290 TraceCheckUtils]: 66: Hoare triple {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,787 INFO L290 TraceCheckUtils]: 68: Hoare triple {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,787 INFO L290 TraceCheckUtils]: 69: Hoare triple {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,788 INFO L290 TraceCheckUtils]: 70: Hoare triple {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:15,788 INFO L290 TraceCheckUtils]: 71: Hoare triple {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:15,788 INFO L290 TraceCheckUtils]: 72: Hoare triple {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:15,789 INFO L290 TraceCheckUtils]: 73: Hoare triple {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:15,789 INFO L290 TraceCheckUtils]: 74: Hoare triple {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 09:00:15,790 INFO L290 TraceCheckUtils]: 75: Hoare triple {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 09:00:15,790 INFO L290 TraceCheckUtils]: 76: Hoare triple {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 09:00:15,790 INFO L290 TraceCheckUtils]: 77: Hoare triple {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-08 09:00:15,791 INFO L290 TraceCheckUtils]: 78: Hoare triple {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-08 09:00:15,791 INFO L290 TraceCheckUtils]: 79: Hoare triple {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 80: Hoare triple {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21960#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 19))} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 81: Hoare triple {21960#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 19))} assume !(~j~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 82: Hoare triple {21936#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 85: Hoare triple {21936#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 86: Hoare triple {21936#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 87: Hoare triple {21936#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 90: Hoare triple {21936#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L272 TraceCheckUtils]: 91: Hoare triple {21936#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-08 09:00:15,792 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-08 09:00:15,793 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-08 09:00:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:00:15,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:15,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282439991] [2022-04-08 09:00:15,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282439991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:15,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423419664] [2022-04-08 09:00:15,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:15,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:15,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:15,794 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:15,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 09:00:15,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:15,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:15,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 09:00:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:16,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:16,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21935#true} is VALID [2022-04-08 09:00:16,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {21935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-08 09:00:16,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-08 09:00:16,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-08 09:00:16,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-08 09:00:16,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {21935#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {21980#(<= 20 main_~edgecount~0)} ~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:16,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 09:00:16,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 09:00:16,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 09:00:16,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:16,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:16,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 09:00:16,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:16,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:16,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 09:00:16,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:16,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:16,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 09:00:16,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:16,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:16,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 09:00:16,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,887 INFO L290 TraceCheckUtils]: 42: Hoare triple {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,890 INFO L290 TraceCheckUtils]: 48: Hoare triple {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,891 INFO L290 TraceCheckUtils]: 50: Hoare triple {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:16,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:16,892 INFO L290 TraceCheckUtils]: 52: Hoare triple {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 09:00:16,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,893 INFO L290 TraceCheckUtils]: 56: Hoare triple {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,894 INFO L290 TraceCheckUtils]: 57: Hoare triple {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,894 INFO L290 TraceCheckUtils]: 58: Hoare triple {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,895 INFO L290 TraceCheckUtils]: 59: Hoare triple {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,895 INFO L290 TraceCheckUtils]: 60: Hoare triple {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,895 INFO L290 TraceCheckUtils]: 61: Hoare triple {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,897 INFO L290 TraceCheckUtils]: 64: Hoare triple {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,897 INFO L290 TraceCheckUtils]: 65: Hoare triple {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,897 INFO L290 TraceCheckUtils]: 66: Hoare triple {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,898 INFO L290 TraceCheckUtils]: 67: Hoare triple {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,898 INFO L290 TraceCheckUtils]: 68: Hoare triple {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,899 INFO L290 TraceCheckUtils]: 69: Hoare triple {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,899 INFO L290 TraceCheckUtils]: 70: Hoare triple {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:16,899 INFO L290 TraceCheckUtils]: 71: Hoare triple {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:16,900 INFO L290 TraceCheckUtils]: 72: Hoare triple {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:16,900 INFO L290 TraceCheckUtils]: 73: Hoare triple {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-08 09:00:16,900 INFO L290 TraceCheckUtils]: 74: Hoare triple {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} is VALID [2022-04-08 09:00:16,901 INFO L290 TraceCheckUtils]: 75: Hoare triple {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} is VALID [2022-04-08 09:00:16,901 INFO L290 TraceCheckUtils]: 76: Hoare triple {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} is VALID [2022-04-08 09:00:16,902 INFO L290 TraceCheckUtils]: 77: Hoare triple {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} is VALID [2022-04-08 09:00:16,902 INFO L290 TraceCheckUtils]: 78: Hoare triple {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} is VALID [2022-04-08 09:00:16,902 INFO L290 TraceCheckUtils]: 79: Hoare triple {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} is VALID [2022-04-08 09:00:16,903 INFO L290 TraceCheckUtils]: 80: Hoare triple {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22225#(and (<= 20 main_~edgecount~0) (<= main_~j~0 19))} is VALID [2022-04-08 09:00:16,903 INFO L290 TraceCheckUtils]: 81: Hoare triple {22225#(and (<= 20 main_~edgecount~0) (<= main_~j~0 19))} assume !(~j~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 09:00:16,903 INFO L290 TraceCheckUtils]: 82: Hoare triple {21936#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {21936#false} is VALID [2022-04-08 09:00:16,903 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-08 09:00:16,903 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 09:00:16,903 INFO L290 TraceCheckUtils]: 85: Hoare triple {21936#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 09:00:16,903 INFO L290 TraceCheckUtils]: 86: Hoare triple {21936#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {21936#false} is VALID [2022-04-08 09:00:16,903 INFO L290 TraceCheckUtils]: 87: Hoare triple {21936#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21936#false} is VALID [2022-04-08 09:00:16,904 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 09:00:16,904 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 09:00:16,904 INFO L290 TraceCheckUtils]: 90: Hoare triple {21936#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 09:00:16,904 INFO L272 TraceCheckUtils]: 91: Hoare triple {21936#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21936#false} is VALID [2022-04-08 09:00:16,904 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-08 09:00:16,904 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-08 09:00:16,904 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-08 09:00:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:00:16,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:17,575 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-08 09:00:17,575 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-08 09:00:17,575 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-08 09:00:17,575 INFO L272 TraceCheckUtils]: 91: Hoare triple {21936#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21936#false} is VALID [2022-04-08 09:00:17,575 INFO L290 TraceCheckUtils]: 90: Hoare triple {21936#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 09:00:17,575 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 09:00:17,576 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 09:00:17,576 INFO L290 TraceCheckUtils]: 87: Hoare triple {21936#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21936#false} is VALID [2022-04-08 09:00:17,576 INFO L290 TraceCheckUtils]: 86: Hoare triple {21936#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {21936#false} is VALID [2022-04-08 09:00:17,576 INFO L290 TraceCheckUtils]: 85: Hoare triple {21936#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 09:00:17,576 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 09:00:17,576 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-08 09:00:17,576 INFO L290 TraceCheckUtils]: 82: Hoare triple {21936#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {21936#false} is VALID [2022-04-08 09:00:17,576 INFO L290 TraceCheckUtils]: 81: Hoare triple {22307#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 09:00:17,576 INFO L290 TraceCheckUtils]: 80: Hoare triple {22311#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22307#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,577 INFO L290 TraceCheckUtils]: 79: Hoare triple {22311#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22311#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,577 INFO L290 TraceCheckUtils]: 78: Hoare triple {22311#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22311#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,577 INFO L290 TraceCheckUtils]: 77: Hoare triple {22321#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22311#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,578 INFO L290 TraceCheckUtils]: 76: Hoare triple {22321#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22321#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,578 INFO L290 TraceCheckUtils]: 75: Hoare triple {22321#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22321#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,579 INFO L290 TraceCheckUtils]: 74: Hoare triple {22331#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22321#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,579 INFO L290 TraceCheckUtils]: 73: Hoare triple {22331#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22331#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,579 INFO L290 TraceCheckUtils]: 72: Hoare triple {22331#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22331#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,580 INFO L290 TraceCheckUtils]: 71: Hoare triple {22341#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22331#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,580 INFO L290 TraceCheckUtils]: 70: Hoare triple {22341#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22341#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,580 INFO L290 TraceCheckUtils]: 69: Hoare triple {22341#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22341#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,581 INFO L290 TraceCheckUtils]: 68: Hoare triple {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22341#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,581 INFO L290 TraceCheckUtils]: 67: Hoare triple {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,581 INFO L290 TraceCheckUtils]: 66: Hoare triple {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,581 INFO L290 TraceCheckUtils]: 65: Hoare triple {22361#(< (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,582 INFO L290 TraceCheckUtils]: 64: Hoare triple {22361#(< (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22361#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,582 INFO L290 TraceCheckUtils]: 63: Hoare triple {22361#(< (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22361#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22361#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,583 INFO L290 TraceCheckUtils]: 61: Hoare triple {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,583 INFO L290 TraceCheckUtils]: 60: Hoare triple {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,583 INFO L290 TraceCheckUtils]: 59: Hoare triple {22381#(< (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {22381#(< (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22381#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {22381#(< (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22381#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {22391#(< (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22381#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {22391#(< (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22391#(< (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {22391#(< (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22391#(< (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {22401#(< (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22391#(< (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {22401#(< (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22401#(< (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {22401#(< (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22401#(< (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {22411#(< (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22401#(< (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {22411#(< (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22411#(< (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {22411#(< (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22411#(< (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {22421#(< (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22411#(< (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {22421#(< (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22421#(< (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {22421#(< (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22421#(< (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {22431#(< (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22421#(< (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {22431#(< (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22431#(< (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {22431#(< (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22431#(< (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {22441#(< (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22431#(< (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {22441#(< (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22441#(< (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {22441#(< (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22441#(< (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {22451#(< (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22441#(< (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {22451#(< (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22451#(< (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {22451#(< (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22451#(< (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {22461#(< (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22451#(< (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {22461#(< (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22461#(< (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {22461#(< (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22461#(< (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {22471#(< (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22461#(< (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {22471#(< (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22471#(< (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {22471#(< (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22471#(< (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {22481#(< (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22471#(< (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {22481#(< (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22481#(< (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {22481#(< (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22481#(< (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22481#(< (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:17,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {21980#(<= 20 main_~edgecount~0)} ~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {21935#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:17,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-08 09:00:17,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-08 09:00:17,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-08 09:00:17,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {21935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-08 09:00:17,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21935#true} is VALID [2022-04-08 09:00:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:00:17,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423419664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:17,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:17,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 65 [2022-04-08 09:00:17,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:17,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1692988985] [2022-04-08 09:00:17,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1692988985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:17,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:17,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 09:00:17,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966398299] [2022-04-08 09:00:17,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:17,602 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-08 09:00:17,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:17,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:17,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:17,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 09:00:17,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:17,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 09:00:17,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=2772, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 09:00:17,663 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:18,736 INFO L93 Difference]: Finished difference Result 179 states and 227 transitions. [2022-04-08 09:00:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 09:00:18,737 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-08 09:00:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-08 09:00:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-08 09:00:18,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 138 transitions. [2022-04-08 09:00:18,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:18,842 INFO L225 Difference]: With dead ends: 179 [2022-04-08 09:00:18,842 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 09:00:18,843 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2333, Invalid=4977, Unknown=0, NotChecked=0, Total=7310 [2022-04-08 09:00:18,844 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 184 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:18,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 60 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:00:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 09:00:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-08 09:00:19,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:19,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:19,096 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:19,096 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:19,097 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-08 09:00:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-08 09:00:19,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:19,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:19,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 103 states. [2022-04-08 09:00:19,103 INFO L87 Difference]: Start difference. First operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 103 states. [2022-04-08 09:00:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:19,104 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-08 09:00:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-08 09:00:19,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:19,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:19,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:19,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2022-04-08 09:00:19,106 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 95 [2022-04-08 09:00:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:19,106 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2022-04-08 09:00:19,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:19,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 128 transitions. [2022-04-08 09:00:19,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-08 09:00:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 09:00:19,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:19,303 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 20, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:19,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:19,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 09:00:19,504 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:19,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash 6650394, now seen corresponding path program 45 times [2022-04-08 09:00:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:19,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1596164670] [2022-04-08 09:00:19,508 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:19,508 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash 6650394, now seen corresponding path program 46 times [2022-04-08 09:00:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:19,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651472588] [2022-04-08 09:00:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:19,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:19,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:19,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {23392#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-08 09:00:19,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-08 09:00:19,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-08 09:00:19,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23392#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:19,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {23392#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-08 09:00:19,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-08 09:00:19,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-08 09:00:19,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-08 09:00:19,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {23384#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:19,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,614 INFO L290 TraceCheckUtils]: 54: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,615 INFO L290 TraceCheckUtils]: 55: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,616 INFO L290 TraceCheckUtils]: 58: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,616 INFO L290 TraceCheckUtils]: 59: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,617 INFO L290 TraceCheckUtils]: 60: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,617 INFO L290 TraceCheckUtils]: 61: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,617 INFO L290 TraceCheckUtils]: 62: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,618 INFO L290 TraceCheckUtils]: 64: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,618 INFO L290 TraceCheckUtils]: 65: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,619 INFO L290 TraceCheckUtils]: 66: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,619 INFO L290 TraceCheckUtils]: 67: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,619 INFO L290 TraceCheckUtils]: 68: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,620 INFO L290 TraceCheckUtils]: 69: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,620 INFO L290 TraceCheckUtils]: 70: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,621 INFO L290 TraceCheckUtils]: 71: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,621 INFO L290 TraceCheckUtils]: 72: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,621 INFO L290 TraceCheckUtils]: 73: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,622 INFO L290 TraceCheckUtils]: 74: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,622 INFO L290 TraceCheckUtils]: 75: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,623 INFO L290 TraceCheckUtils]: 77: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,623 INFO L290 TraceCheckUtils]: 78: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,624 INFO L290 TraceCheckUtils]: 79: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,624 INFO L290 TraceCheckUtils]: 80: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,624 INFO L290 TraceCheckUtils]: 81: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,625 INFO L290 TraceCheckUtils]: 82: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,625 INFO L290 TraceCheckUtils]: 83: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:19,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {23391#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 86: Hoare triple {23391#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 87: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 88: Hoare triple {23385#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 89: Hoare triple {23385#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 90: Hoare triple {23385#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 91: Hoare triple {23385#false} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 93: Hoare triple {23385#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L272 TraceCheckUtils]: 94: Hoare triple {23385#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-08 09:00:19,626 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-08 09:00:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2022-04-08 09:00:19,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:19,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651472588] [2022-04-08 09:00:19,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651472588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:19,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781873429] [2022-04-08 09:00:19,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:19,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:19,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:19,631 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:19,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 09:00:19,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:19,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:19,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 09:00:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:19,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:20,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23384#true} is VALID [2022-04-08 09:00:20,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {23384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-08 09:00:20,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-08 09:00:20,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-08 09:00:20,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-08 09:00:20,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {23384#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {23384#true} is VALID [2022-04-08 09:00:20,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:20,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {23384#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 09:00:20,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 09:00:20,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:20,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {23384#true} assume !(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:20,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {23384#true} ~i~0 := 0; {23384#true} is VALID [2022-04-08 09:00:20,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:20,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {23465#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:20,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {23465#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:20,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {23465#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23475#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:20,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {23475#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23475#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:20,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {23475#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23475#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:20,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {23475#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23485#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:20,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {23485#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23485#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:20,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {23485#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23485#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:20,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {23485#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23495#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:20,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {23495#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23495#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:20,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {23495#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23495#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:20,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {23495#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23505#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:20,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {23505#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23505#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:20,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {23505#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23505#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:20,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {23505#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23515#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:20,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {23515#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23515#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:20,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {23515#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23515#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:20,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {23515#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23525#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:20,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {23525#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23525#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:20,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {23525#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23525#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:20,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {23525#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23535#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:20,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {23535#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23535#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:20,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {23535#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23535#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:20,481 INFO L290 TraceCheckUtils]: 47: Hoare triple {23535#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23545#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:20,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {23545#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23545#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:20,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {23545#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23545#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:20,482 INFO L290 TraceCheckUtils]: 50: Hoare triple {23545#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23555#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:20,482 INFO L290 TraceCheckUtils]: 51: Hoare triple {23555#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23555#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:20,483 INFO L290 TraceCheckUtils]: 52: Hoare triple {23555#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23555#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:20,483 INFO L290 TraceCheckUtils]: 53: Hoare triple {23555#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23565#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:20,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {23565#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23565#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:20,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {23565#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23565#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:20,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {23565#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23575#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:20,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {23575#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23575#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:20,485 INFO L290 TraceCheckUtils]: 58: Hoare triple {23575#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23575#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:20,485 INFO L290 TraceCheckUtils]: 59: Hoare triple {23575#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23585#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:20,486 INFO L290 TraceCheckUtils]: 60: Hoare triple {23585#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23585#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:20,486 INFO L290 TraceCheckUtils]: 61: Hoare triple {23585#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23585#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:20,487 INFO L290 TraceCheckUtils]: 62: Hoare triple {23585#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23595#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:20,487 INFO L290 TraceCheckUtils]: 63: Hoare triple {23595#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23595#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:20,487 INFO L290 TraceCheckUtils]: 64: Hoare triple {23595#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23595#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:20,488 INFO L290 TraceCheckUtils]: 65: Hoare triple {23595#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23605#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:20,488 INFO L290 TraceCheckUtils]: 66: Hoare triple {23605#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23605#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:20,488 INFO L290 TraceCheckUtils]: 67: Hoare triple {23605#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23605#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:20,489 INFO L290 TraceCheckUtils]: 68: Hoare triple {23605#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23615#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:20,489 INFO L290 TraceCheckUtils]: 69: Hoare triple {23615#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23615#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:20,489 INFO L290 TraceCheckUtils]: 70: Hoare triple {23615#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23615#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:20,490 INFO L290 TraceCheckUtils]: 71: Hoare triple {23615#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23625#(<= 16 main_~j~0)} is VALID [2022-04-08 09:00:20,490 INFO L290 TraceCheckUtils]: 72: Hoare triple {23625#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23625#(<= 16 main_~j~0)} is VALID [2022-04-08 09:00:20,490 INFO L290 TraceCheckUtils]: 73: Hoare triple {23625#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23625#(<= 16 main_~j~0)} is VALID [2022-04-08 09:00:20,491 INFO L290 TraceCheckUtils]: 74: Hoare triple {23625#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23635#(<= 17 main_~j~0)} is VALID [2022-04-08 09:00:20,491 INFO L290 TraceCheckUtils]: 75: Hoare triple {23635#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23635#(<= 17 main_~j~0)} is VALID [2022-04-08 09:00:20,491 INFO L290 TraceCheckUtils]: 76: Hoare triple {23635#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23635#(<= 17 main_~j~0)} is VALID [2022-04-08 09:00:20,492 INFO L290 TraceCheckUtils]: 77: Hoare triple {23635#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23645#(<= 18 main_~j~0)} is VALID [2022-04-08 09:00:20,492 INFO L290 TraceCheckUtils]: 78: Hoare triple {23645#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23645#(<= 18 main_~j~0)} is VALID [2022-04-08 09:00:20,492 INFO L290 TraceCheckUtils]: 79: Hoare triple {23645#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23645#(<= 18 main_~j~0)} is VALID [2022-04-08 09:00:20,493 INFO L290 TraceCheckUtils]: 80: Hoare triple {23645#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23655#(<= 19 main_~j~0)} is VALID [2022-04-08 09:00:20,494 INFO L290 TraceCheckUtils]: 81: Hoare triple {23655#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:20,495 INFO L290 TraceCheckUtils]: 82: Hoare triple {23659#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:20,495 INFO L290 TraceCheckUtils]: 83: Hoare triple {23659#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:20,495 INFO L290 TraceCheckUtils]: 84: Hoare triple {23659#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:20,496 INFO L290 TraceCheckUtils]: 85: Hoare triple {23659#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:20,496 INFO L290 TraceCheckUtils]: 86: Hoare triple {23659#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:20,496 INFO L290 TraceCheckUtils]: 87: Hoare triple {23659#(< 19 main_~edgecount~0)} ~i~0 := 0; {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:00:20,497 INFO L290 TraceCheckUtils]: 88: Hoare triple {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:00:20,497 INFO L290 TraceCheckUtils]: 89: Hoare triple {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:00:20,498 INFO L290 TraceCheckUtils]: 90: Hoare triple {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {23688#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:00:20,498 INFO L290 TraceCheckUtils]: 91: Hoare triple {23688#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-08 09:00:20,498 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-08 09:00:20,498 INFO L290 TraceCheckUtils]: 93: Hoare triple {23385#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-08 09:00:20,498 INFO L272 TraceCheckUtils]: 94: Hoare triple {23385#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {23385#false} is VALID [2022-04-08 09:00:20,498 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-08 09:00:20,499 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-08 09:00:20,499 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-08 09:00:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 533 proven. 59 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 09:00:20,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:21,123 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-08 09:00:21,124 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-08 09:00:21,124 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-08 09:00:21,124 INFO L272 TraceCheckUtils]: 94: Hoare triple {23385#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {23385#false} is VALID [2022-04-08 09:00:21,124 INFO L290 TraceCheckUtils]: 93: Hoare triple {23385#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-08 09:00:21,124 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-08 09:00:21,124 INFO L290 TraceCheckUtils]: 91: Hoare triple {23728#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-08 09:00:21,125 INFO L290 TraceCheckUtils]: 90: Hoare triple {23732#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {23728#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:00:21,125 INFO L290 TraceCheckUtils]: 89: Hoare triple {23732#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {23732#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:21,125 INFO L290 TraceCheckUtils]: 88: Hoare triple {23732#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {23732#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:21,125 INFO L290 TraceCheckUtils]: 87: Hoare triple {23742#(< 1 main_~edgecount~0)} ~i~0 := 0; {23732#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:21,126 INFO L290 TraceCheckUtils]: 86: Hoare triple {23742#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:21,126 INFO L290 TraceCheckUtils]: 85: Hoare triple {23742#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:21,126 INFO L290 TraceCheckUtils]: 84: Hoare triple {23742#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:21,126 INFO L290 TraceCheckUtils]: 83: Hoare triple {23742#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:21,126 INFO L290 TraceCheckUtils]: 82: Hoare triple {23742#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:21,127 INFO L290 TraceCheckUtils]: 81: Hoare triple {23475#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:21,127 INFO L290 TraceCheckUtils]: 80: Hoare triple {23465#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23475#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:21,128 INFO L290 TraceCheckUtils]: 79: Hoare triple {23465#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:21,128 INFO L290 TraceCheckUtils]: 78: Hoare triple {23465#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:21,128 INFO L290 TraceCheckUtils]: 77: Hoare triple {23773#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:21,128 INFO L290 TraceCheckUtils]: 76: Hoare triple {23773#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23773#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:21,129 INFO L290 TraceCheckUtils]: 75: Hoare triple {23773#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23773#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:21,129 INFO L290 TraceCheckUtils]: 74: Hoare triple {23783#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23773#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:21,129 INFO L290 TraceCheckUtils]: 73: Hoare triple {23783#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23783#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:21,130 INFO L290 TraceCheckUtils]: 72: Hoare triple {23783#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23783#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:21,130 INFO L290 TraceCheckUtils]: 71: Hoare triple {23793#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23783#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:21,131 INFO L290 TraceCheckUtils]: 70: Hoare triple {23793#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23793#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:21,131 INFO L290 TraceCheckUtils]: 69: Hoare triple {23793#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23793#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:21,131 INFO L290 TraceCheckUtils]: 68: Hoare triple {23803#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23793#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:21,132 INFO L290 TraceCheckUtils]: 67: Hoare triple {23803#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23803#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:21,132 INFO L290 TraceCheckUtils]: 66: Hoare triple {23803#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23803#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:21,132 INFO L290 TraceCheckUtils]: 65: Hoare triple {23813#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23803#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:21,132 INFO L290 TraceCheckUtils]: 64: Hoare triple {23813#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23813#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:21,133 INFO L290 TraceCheckUtils]: 63: Hoare triple {23813#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23813#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:21,133 INFO L290 TraceCheckUtils]: 62: Hoare triple {23823#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23813#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:21,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {23823#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23823#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:21,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {23823#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23823#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:21,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {23833#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23823#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:21,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {23833#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23833#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:21,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {23833#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23833#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:21,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {23843#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23833#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:21,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {23843#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23843#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:21,135 INFO L290 TraceCheckUtils]: 54: Hoare triple {23843#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23843#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:21,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {23853#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23843#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:21,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {23853#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23853#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:21,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {23853#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23853#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:21,137 INFO L290 TraceCheckUtils]: 50: Hoare triple {23863#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23853#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:21,137 INFO L290 TraceCheckUtils]: 49: Hoare triple {23863#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23863#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:21,137 INFO L290 TraceCheckUtils]: 48: Hoare triple {23863#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23863#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:21,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {23873#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23863#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:21,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {23873#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23873#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:21,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {23873#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23873#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:21,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {23883#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23873#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:21,139 INFO L290 TraceCheckUtils]: 43: Hoare triple {23883#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23883#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:21,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {23883#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23883#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:21,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {23893#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23883#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:21,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {23893#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23893#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:00:21,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {23893#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23893#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:00:21,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {23903#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23893#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:00:21,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {23903#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23903#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:00:21,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {23903#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23903#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:00:21,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {23913#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23903#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:00:21,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {23913#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23913#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:00:21,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {23913#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23913#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:00:21,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {23923#(<= 0 (+ main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23913#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:00:21,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {23923#(<= 0 (+ main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23923#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 09:00:21,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {23923#(<= 0 (+ main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23923#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 09:00:21,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {23933#(<= 0 (+ main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23923#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 09:00:21,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {23933#(<= 0 (+ main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23933#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 09:00:21,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {23933#(<= 0 (+ main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23933#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 09:00:21,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {23943#(<= 0 (+ main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23933#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {23943#(<= 0 (+ main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23943#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {23943#(<= 0 (+ main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23943#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {23943#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {23384#true} ~i~0 := 0; {23384#true} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {23384#true} assume !(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 09:00:21,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {23384#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {23384#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {23384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-08 09:00:21,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23384#true} is VALID [2022-04-08 09:00:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 533 proven. 59 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 09:00:21,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781873429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:21,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:21,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 25, 25] total 50 [2022-04-08 09:00:21,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:21,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1596164670] [2022-04-08 09:00:21,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1596164670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:21,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:21,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:00:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392184819] [2022-04-08 09:00:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:21,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-08 09:00:21,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:21,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:21,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:21,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:00:21,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:21,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:00:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=1636, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 09:00:21,167 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:22,106 INFO L93 Difference]: Finished difference Result 258 states and 330 transitions. [2022-04-08 09:00:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:00:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-08 09:00:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-08 09:00:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-08 09:00:22,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2022-04-08 09:00:22,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:22,185 INFO L225 Difference]: With dead ends: 258 [2022-04-08 09:00:22,185 INFO L226 Difference]: Without dead ends: 242 [2022-04-08 09:00:22,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 09:00:22,186 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 113 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:22,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 34 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-08 09:00:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 166. [2022-04-08 09:00:22,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:22,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:22,719 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:22,719 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:22,722 INFO L93 Difference]: Finished difference Result 242 states and 312 transitions. [2022-04-08 09:00:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 312 transitions. [2022-04-08 09:00:22,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:22,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:22,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 242 states. [2022-04-08 09:00:22,723 INFO L87 Difference]: Start difference. First operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 242 states. [2022-04-08 09:00:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:22,727 INFO L93 Difference]: Finished difference Result 242 states and 312 transitions. [2022-04-08 09:00:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 312 transitions. [2022-04-08 09:00:22,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:22,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:22,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:22,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2022-04-08 09:00:22,730 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 98 [2022-04-08 09:00:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:22,730 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2022-04-08 09:00:22,730 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:22,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 212 transitions. [2022-04-08 09:00:23,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2022-04-08 09:00:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-08 09:00:23,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:23,064 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 40, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:23,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:23,265 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:23,265 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 576417944, now seen corresponding path program 47 times [2022-04-08 09:00:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:23,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1505113780] [2022-04-08 09:00:23,268 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:23,268 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 576417944, now seen corresponding path program 48 times [2022-04-08 09:00:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:23,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002023286] [2022-04-08 09:00:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:23,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:23,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {25371#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-08 09:00:23,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-08 09:00:23,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-08 09:00:23,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25371#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:23,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {25371#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-08 09:00:23,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-08 09:00:23,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-08 09:00:23,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-08 09:00:23,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {25362#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:23,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,435 INFO L290 TraceCheckUtils]: 48: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,436 INFO L290 TraceCheckUtils]: 51: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,438 INFO L290 TraceCheckUtils]: 55: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,440 INFO L290 TraceCheckUtils]: 62: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,441 INFO L290 TraceCheckUtils]: 63: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,441 INFO L290 TraceCheckUtils]: 65: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,442 INFO L290 TraceCheckUtils]: 68: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,444 INFO L290 TraceCheckUtils]: 71: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,444 INFO L290 TraceCheckUtils]: 72: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,445 INFO L290 TraceCheckUtils]: 74: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,445 INFO L290 TraceCheckUtils]: 75: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,445 INFO L290 TraceCheckUtils]: 76: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,446 INFO L290 TraceCheckUtils]: 77: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,446 INFO L290 TraceCheckUtils]: 78: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,447 INFO L290 TraceCheckUtils]: 79: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,447 INFO L290 TraceCheckUtils]: 80: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,447 INFO L290 TraceCheckUtils]: 81: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,448 INFO L290 TraceCheckUtils]: 82: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,448 INFO L290 TraceCheckUtils]: 83: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,448 INFO L290 TraceCheckUtils]: 84: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:23,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,449 INFO L290 TraceCheckUtils]: 86: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,449 INFO L290 TraceCheckUtils]: 87: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,450 INFO L290 TraceCheckUtils]: 88: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,450 INFO L290 TraceCheckUtils]: 89: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,450 INFO L290 TraceCheckUtils]: 90: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,451 INFO L290 TraceCheckUtils]: 91: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,451 INFO L290 TraceCheckUtils]: 92: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,452 INFO L290 TraceCheckUtils]: 94: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,452 INFO L290 TraceCheckUtils]: 95: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,453 INFO L290 TraceCheckUtils]: 96: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,453 INFO L290 TraceCheckUtils]: 97: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,453 INFO L290 TraceCheckUtils]: 98: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,454 INFO L290 TraceCheckUtils]: 99: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,454 INFO L290 TraceCheckUtils]: 100: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,454 INFO L290 TraceCheckUtils]: 101: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,455 INFO L290 TraceCheckUtils]: 102: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,455 INFO L290 TraceCheckUtils]: 103: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,456 INFO L290 TraceCheckUtils]: 104: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,456 INFO L290 TraceCheckUtils]: 105: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,456 INFO L290 TraceCheckUtils]: 106: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,457 INFO L290 TraceCheckUtils]: 107: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,457 INFO L290 TraceCheckUtils]: 108: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,458 INFO L290 TraceCheckUtils]: 109: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,458 INFO L290 TraceCheckUtils]: 110: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,458 INFO L290 TraceCheckUtils]: 111: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,459 INFO L290 TraceCheckUtils]: 112: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,459 INFO L290 TraceCheckUtils]: 113: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,459 INFO L290 TraceCheckUtils]: 114: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,460 INFO L290 TraceCheckUtils]: 115: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,460 INFO L290 TraceCheckUtils]: 116: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,460 INFO L290 TraceCheckUtils]: 117: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,461 INFO L290 TraceCheckUtils]: 118: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,461 INFO L290 TraceCheckUtils]: 119: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,462 INFO L290 TraceCheckUtils]: 120: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,462 INFO L290 TraceCheckUtils]: 121: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,462 INFO L290 TraceCheckUtils]: 122: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,463 INFO L290 TraceCheckUtils]: 123: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,463 INFO L290 TraceCheckUtils]: 124: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,463 INFO L290 TraceCheckUtils]: 125: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,464 INFO L290 TraceCheckUtils]: 126: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,464 INFO L290 TraceCheckUtils]: 127: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,464 INFO L290 TraceCheckUtils]: 128: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,465 INFO L290 TraceCheckUtils]: 129: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,465 INFO L290 TraceCheckUtils]: 130: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,466 INFO L290 TraceCheckUtils]: 131: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,466 INFO L290 TraceCheckUtils]: 132: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,466 INFO L290 TraceCheckUtils]: 133: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,467 INFO L290 TraceCheckUtils]: 134: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,467 INFO L290 TraceCheckUtils]: 135: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,468 INFO L290 TraceCheckUtils]: 136: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,468 INFO L290 TraceCheckUtils]: 137: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,468 INFO L290 TraceCheckUtils]: 138: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,469 INFO L290 TraceCheckUtils]: 139: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,469 INFO L290 TraceCheckUtils]: 140: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,469 INFO L290 TraceCheckUtils]: 141: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,470 INFO L290 TraceCheckUtils]: 142: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,470 INFO L290 TraceCheckUtils]: 143: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,470 INFO L290 TraceCheckUtils]: 144: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,471 INFO L290 TraceCheckUtils]: 145: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,471 INFO L290 TraceCheckUtils]: 146: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,471 INFO L290 TraceCheckUtils]: 147: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~j~0 < ~edgecount~0); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:23,472 INFO L290 TraceCheckUtils]: 148: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25370#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 149: Hoare triple {25370#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 < ~nodecount~0); {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 150: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 151: Hoare triple {25363#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 152: Hoare triple {25363#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 153: Hoare triple {25363#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 154: Hoare triple {25363#false} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 156: Hoare triple {25363#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L272 TraceCheckUtils]: 157: Hoare triple {25363#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-08 09:00:23,487 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-08 09:00:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 0 proven. 1245 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2022-04-08 09:00:23,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:23,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002023286] [2022-04-08 09:00:23,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002023286] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:23,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325340383] [2022-04-08 09:00:23,489 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:00:23,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:23,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:23,490 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:23,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 09:00:23,702 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:00:23,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:23,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:00:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:23,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:24,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25362#true} is VALID [2022-04-08 09:00:24,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {25362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-08 09:00:24,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-08 09:00:24,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-08 09:00:24,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-08 09:00:24,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {25362#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {25390#(<= 20 main_~edgecount~0)} ~i~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,242 INFO L290 TraceCheckUtils]: 66: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,243 INFO L290 TraceCheckUtils]: 69: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,243 INFO L290 TraceCheckUtils]: 70: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,244 INFO L290 TraceCheckUtils]: 71: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,244 INFO L290 TraceCheckUtils]: 73: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,245 INFO L290 TraceCheckUtils]: 75: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,245 INFO L290 TraceCheckUtils]: 76: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,245 INFO L290 TraceCheckUtils]: 77: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,246 INFO L290 TraceCheckUtils]: 78: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,246 INFO L290 TraceCheckUtils]: 79: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,246 INFO L290 TraceCheckUtils]: 80: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,246 INFO L290 TraceCheckUtils]: 81: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,247 INFO L290 TraceCheckUtils]: 82: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,247 INFO L290 TraceCheckUtils]: 83: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,247 INFO L290 TraceCheckUtils]: 84: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,248 INFO L290 TraceCheckUtils]: 85: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,248 INFO L290 TraceCheckUtils]: 86: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,248 INFO L290 TraceCheckUtils]: 87: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,248 INFO L290 TraceCheckUtils]: 88: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,249 INFO L290 TraceCheckUtils]: 89: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,249 INFO L290 TraceCheckUtils]: 90: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,249 INFO L290 TraceCheckUtils]: 91: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,249 INFO L290 TraceCheckUtils]: 92: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,250 INFO L290 TraceCheckUtils]: 93: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,250 INFO L290 TraceCheckUtils]: 94: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,250 INFO L290 TraceCheckUtils]: 95: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,250 INFO L290 TraceCheckUtils]: 96: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,251 INFO L290 TraceCheckUtils]: 97: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,251 INFO L290 TraceCheckUtils]: 98: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,251 INFO L290 TraceCheckUtils]: 99: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,252 INFO L290 TraceCheckUtils]: 100: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,252 INFO L290 TraceCheckUtils]: 101: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,252 INFO L290 TraceCheckUtils]: 102: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,252 INFO L290 TraceCheckUtils]: 103: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,253 INFO L290 TraceCheckUtils]: 104: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,253 INFO L290 TraceCheckUtils]: 105: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,253 INFO L290 TraceCheckUtils]: 106: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,253 INFO L290 TraceCheckUtils]: 107: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,254 INFO L290 TraceCheckUtils]: 108: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,254 INFO L290 TraceCheckUtils]: 109: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,254 INFO L290 TraceCheckUtils]: 110: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,254 INFO L290 TraceCheckUtils]: 111: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,255 INFO L290 TraceCheckUtils]: 112: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,255 INFO L290 TraceCheckUtils]: 113: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,255 INFO L290 TraceCheckUtils]: 114: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,255 INFO L290 TraceCheckUtils]: 115: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,256 INFO L290 TraceCheckUtils]: 116: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,256 INFO L290 TraceCheckUtils]: 117: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,256 INFO L290 TraceCheckUtils]: 118: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,256 INFO L290 TraceCheckUtils]: 119: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,257 INFO L290 TraceCheckUtils]: 120: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,257 INFO L290 TraceCheckUtils]: 121: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,257 INFO L290 TraceCheckUtils]: 122: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,257 INFO L290 TraceCheckUtils]: 123: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,258 INFO L290 TraceCheckUtils]: 124: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,258 INFO L290 TraceCheckUtils]: 125: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,258 INFO L290 TraceCheckUtils]: 126: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,258 INFO L290 TraceCheckUtils]: 127: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,259 INFO L290 TraceCheckUtils]: 128: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,259 INFO L290 TraceCheckUtils]: 129: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,259 INFO L290 TraceCheckUtils]: 130: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,259 INFO L290 TraceCheckUtils]: 131: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,260 INFO L290 TraceCheckUtils]: 132: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,260 INFO L290 TraceCheckUtils]: 133: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,260 INFO L290 TraceCheckUtils]: 134: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,260 INFO L290 TraceCheckUtils]: 135: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,261 INFO L290 TraceCheckUtils]: 136: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,261 INFO L290 TraceCheckUtils]: 137: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,261 INFO L290 TraceCheckUtils]: 138: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,261 INFO L290 TraceCheckUtils]: 139: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,262 INFO L290 TraceCheckUtils]: 140: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,262 INFO L290 TraceCheckUtils]: 141: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,262 INFO L290 TraceCheckUtils]: 142: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,262 INFO L290 TraceCheckUtils]: 143: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,263 INFO L290 TraceCheckUtils]: 144: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,263 INFO L290 TraceCheckUtils]: 145: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,263 INFO L290 TraceCheckUtils]: 146: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,263 INFO L290 TraceCheckUtils]: 147: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,264 INFO L290 TraceCheckUtils]: 148: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,264 INFO L290 TraceCheckUtils]: 149: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,264 INFO L290 TraceCheckUtils]: 150: Hoare triple {25390#(<= 20 main_~edgecount~0)} ~i~0 := 0; {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:24,265 INFO L290 TraceCheckUtils]: 151: Hoare triple {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:24,265 INFO L290 TraceCheckUtils]: 152: Hoare triple {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:24,265 INFO L290 TraceCheckUtils]: 153: Hoare triple {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {25836#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:24,266 INFO L290 TraceCheckUtils]: 154: Hoare triple {25836#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-08 09:00:24,266 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-08 09:00:24,266 INFO L290 TraceCheckUtils]: 156: Hoare triple {25363#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-08 09:00:24,266 INFO L272 TraceCheckUtils]: 157: Hoare triple {25363#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {25363#false} is VALID [2022-04-08 09:00:24,266 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-08 09:00:24,266 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-08 09:00:24,266 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-08 09:00:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2460 trivial. 0 not checked. [2022-04-08 09:00:24,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:24,737 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-08 09:00:24,737 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-08 09:00:24,737 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-08 09:00:24,738 INFO L272 TraceCheckUtils]: 157: Hoare triple {25363#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {25363#false} is VALID [2022-04-08 09:00:24,738 INFO L290 TraceCheckUtils]: 156: Hoare triple {25363#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-08 09:00:24,738 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-08 09:00:24,738 INFO L290 TraceCheckUtils]: 154: Hoare triple {25876#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-08 09:00:24,738 INFO L290 TraceCheckUtils]: 153: Hoare triple {25880#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {25876#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,739 INFO L290 TraceCheckUtils]: 152: Hoare triple {25880#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {25880#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:24,739 INFO L290 TraceCheckUtils]: 151: Hoare triple {25880#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {25880#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:24,739 INFO L290 TraceCheckUtils]: 150: Hoare triple {25890#(< 1 main_~edgecount~0)} ~i~0 := 0; {25880#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:24,739 INFO L290 TraceCheckUtils]: 149: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,740 INFO L290 TraceCheckUtils]: 148: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,740 INFO L290 TraceCheckUtils]: 147: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,740 INFO L290 TraceCheckUtils]: 146: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,740 INFO L290 TraceCheckUtils]: 145: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,741 INFO L290 TraceCheckUtils]: 144: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,741 INFO L290 TraceCheckUtils]: 143: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,741 INFO L290 TraceCheckUtils]: 142: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,741 INFO L290 TraceCheckUtils]: 141: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,741 INFO L290 TraceCheckUtils]: 140: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,742 INFO L290 TraceCheckUtils]: 139: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,742 INFO L290 TraceCheckUtils]: 138: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,742 INFO L290 TraceCheckUtils]: 137: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,742 INFO L290 TraceCheckUtils]: 136: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,743 INFO L290 TraceCheckUtils]: 135: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,743 INFO L290 TraceCheckUtils]: 134: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,743 INFO L290 TraceCheckUtils]: 133: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,743 INFO L290 TraceCheckUtils]: 132: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,744 INFO L290 TraceCheckUtils]: 131: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,744 INFO L290 TraceCheckUtils]: 130: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,744 INFO L290 TraceCheckUtils]: 129: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,744 INFO L290 TraceCheckUtils]: 128: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,745 INFO L290 TraceCheckUtils]: 127: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,745 INFO L290 TraceCheckUtils]: 126: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,745 INFO L290 TraceCheckUtils]: 125: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,745 INFO L290 TraceCheckUtils]: 124: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,746 INFO L290 TraceCheckUtils]: 123: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,746 INFO L290 TraceCheckUtils]: 122: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,746 INFO L290 TraceCheckUtils]: 121: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,746 INFO L290 TraceCheckUtils]: 120: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,746 INFO L290 TraceCheckUtils]: 119: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,747 INFO L290 TraceCheckUtils]: 118: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,747 INFO L290 TraceCheckUtils]: 117: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,747 INFO L290 TraceCheckUtils]: 116: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,748 INFO L290 TraceCheckUtils]: 115: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,748 INFO L290 TraceCheckUtils]: 114: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,748 INFO L290 TraceCheckUtils]: 113: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,748 INFO L290 TraceCheckUtils]: 112: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,749 INFO L290 TraceCheckUtils]: 111: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,749 INFO L290 TraceCheckUtils]: 110: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,749 INFO L290 TraceCheckUtils]: 109: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,749 INFO L290 TraceCheckUtils]: 108: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,750 INFO L290 TraceCheckUtils]: 107: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,750 INFO L290 TraceCheckUtils]: 106: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,750 INFO L290 TraceCheckUtils]: 105: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,751 INFO L290 TraceCheckUtils]: 104: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,751 INFO L290 TraceCheckUtils]: 103: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,751 INFO L290 TraceCheckUtils]: 102: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,751 INFO L290 TraceCheckUtils]: 101: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,752 INFO L290 TraceCheckUtils]: 100: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,752 INFO L290 TraceCheckUtils]: 99: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,752 INFO L290 TraceCheckUtils]: 98: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,752 INFO L290 TraceCheckUtils]: 97: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,753 INFO L290 TraceCheckUtils]: 96: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,753 INFO L290 TraceCheckUtils]: 95: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,753 INFO L290 TraceCheckUtils]: 94: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,753 INFO L290 TraceCheckUtils]: 93: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,754 INFO L290 TraceCheckUtils]: 92: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,754 INFO L290 TraceCheckUtils]: 91: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,754 INFO L290 TraceCheckUtils]: 90: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,754 INFO L290 TraceCheckUtils]: 89: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,754 INFO L290 TraceCheckUtils]: 88: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,755 INFO L290 TraceCheckUtils]: 87: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,756 INFO L290 TraceCheckUtils]: 83: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,756 INFO L290 TraceCheckUtils]: 82: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,756 INFO L290 TraceCheckUtils]: 81: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,756 INFO L290 TraceCheckUtils]: 80: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,757 INFO L290 TraceCheckUtils]: 79: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,757 INFO L290 TraceCheckUtils]: 78: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,757 INFO L290 TraceCheckUtils]: 77: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,757 INFO L290 TraceCheckUtils]: 76: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,758 INFO L290 TraceCheckUtils]: 75: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,758 INFO L290 TraceCheckUtils]: 74: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,758 INFO L290 TraceCheckUtils]: 73: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,758 INFO L290 TraceCheckUtils]: 72: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,759 INFO L290 TraceCheckUtils]: 71: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,759 INFO L290 TraceCheckUtils]: 70: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,759 INFO L290 TraceCheckUtils]: 69: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,760 INFO L290 TraceCheckUtils]: 67: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,760 INFO L290 TraceCheckUtils]: 66: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,760 INFO L290 TraceCheckUtils]: 65: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,760 INFO L290 TraceCheckUtils]: 64: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,761 INFO L290 TraceCheckUtils]: 63: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,761 INFO L290 TraceCheckUtils]: 62: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,761 INFO L290 TraceCheckUtils]: 61: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,761 INFO L290 TraceCheckUtils]: 60: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,761 INFO L290 TraceCheckUtils]: 59: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,762 INFO L290 TraceCheckUtils]: 57: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,762 INFO L290 TraceCheckUtils]: 56: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,762 INFO L290 TraceCheckUtils]: 55: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {25890#(< 1 main_~edgecount~0)} ~i~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {25890#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {25362#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:24,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-08 09:00:24,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-08 09:00:24,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-08 09:00:24,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {25362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-08 09:00:24,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25362#true} is VALID [2022-04-08 09:00:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2460 trivial. 0 not checked. [2022-04-08 09:00:24,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325340383] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:24,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:24,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-08 09:00:24,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:24,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1505113780] [2022-04-08 09:00:24,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1505113780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:24,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:24,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:00:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843018242] [2022-04-08 09:00:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:24,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-08 09:00:24,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:24,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:24,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:24,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:00:24,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:24,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:00:24,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:00:24,811 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:26,101 INFO L93 Difference]: Finished difference Result 329 states and 424 transitions. [2022-04-08 09:00:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:00:26,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-08 09:00:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-08 09:00:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-08 09:00:26,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-08 09:00:26,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:26,196 INFO L225 Difference]: With dead ends: 329 [2022-04-08 09:00:26,196 INFO L226 Difference]: Without dead ends: 313 [2022-04-08 09:00:26,197 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:00:26,197 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:26,197 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 34 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-08 09:00:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 229. [2022-04-08 09:00:27,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:27,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:27,044 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:27,044 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:27,052 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2022-04-08 09:00:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 406 transitions. [2022-04-08 09:00:27,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:27,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:27,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 313 states. [2022-04-08 09:00:27,053 INFO L87 Difference]: Start difference. First operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 313 states. [2022-04-08 09:00:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:27,057 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2022-04-08 09:00:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 406 transitions. [2022-04-08 09:00:27,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:27,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:27,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:27,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2022-04-08 09:00:27,061 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 161 [2022-04-08 09:00:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:27,061 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2022-04-08 09:00:27,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:27,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 296 transitions. [2022-04-08 09:00:27,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-04-08 09:00:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-08 09:00:27,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:27,517 INFO L499 BasicCegarLoop]: trace histogram [60, 60, 60, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:27,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:27,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-08 09:00:27,731 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:27,732 INFO L85 PathProgramCache]: Analyzing trace with hash 54436442, now seen corresponding path program 49 times [2022-04-08 09:00:27,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:27,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [55804718] [2022-04-08 09:00:27,734 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:27,734 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash 54436442, now seen corresponding path program 50 times [2022-04-08 09:00:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:27,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944304381] [2022-04-08 09:00:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:27,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:27,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {28103#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-08 09:00:27,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-08 09:00:27,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-08 09:00:27,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28103#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:27,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {28103#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-08 09:00:27,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-08 09:00:27,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-08 09:00:27,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-08 09:00:27,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {28093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:27,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,940 INFO L290 TraceCheckUtils]: 44: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,943 INFO L290 TraceCheckUtils]: 50: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,943 INFO L290 TraceCheckUtils]: 51: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,943 INFO L290 TraceCheckUtils]: 52: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,944 INFO L290 TraceCheckUtils]: 53: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,944 INFO L290 TraceCheckUtils]: 54: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,944 INFO L290 TraceCheckUtils]: 55: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,946 INFO L290 TraceCheckUtils]: 59: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,947 INFO L290 TraceCheckUtils]: 64: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,948 INFO L290 TraceCheckUtils]: 65: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,949 INFO L290 TraceCheckUtils]: 67: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,949 INFO L290 TraceCheckUtils]: 68: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,949 INFO L290 TraceCheckUtils]: 69: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,950 INFO L290 TraceCheckUtils]: 70: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,950 INFO L290 TraceCheckUtils]: 71: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,950 INFO L290 TraceCheckUtils]: 72: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,951 INFO L290 TraceCheckUtils]: 73: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,951 INFO L290 TraceCheckUtils]: 74: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,951 INFO L290 TraceCheckUtils]: 75: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,952 INFO L290 TraceCheckUtils]: 76: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,952 INFO L290 TraceCheckUtils]: 77: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,953 INFO L290 TraceCheckUtils]: 79: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,953 INFO L290 TraceCheckUtils]: 80: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,953 INFO L290 TraceCheckUtils]: 81: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,954 INFO L290 TraceCheckUtils]: 82: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,954 INFO L290 TraceCheckUtils]: 83: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,954 INFO L290 TraceCheckUtils]: 84: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:27,955 INFO L290 TraceCheckUtils]: 85: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,955 INFO L290 TraceCheckUtils]: 86: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,955 INFO L290 TraceCheckUtils]: 87: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,956 INFO L290 TraceCheckUtils]: 88: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,956 INFO L290 TraceCheckUtils]: 89: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,956 INFO L290 TraceCheckUtils]: 90: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,957 INFO L290 TraceCheckUtils]: 91: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,957 INFO L290 TraceCheckUtils]: 92: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,957 INFO L290 TraceCheckUtils]: 93: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,958 INFO L290 TraceCheckUtils]: 94: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,958 INFO L290 TraceCheckUtils]: 95: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,958 INFO L290 TraceCheckUtils]: 96: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,959 INFO L290 TraceCheckUtils]: 97: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,959 INFO L290 TraceCheckUtils]: 98: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,959 INFO L290 TraceCheckUtils]: 99: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,960 INFO L290 TraceCheckUtils]: 100: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,960 INFO L290 TraceCheckUtils]: 101: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,961 INFO L290 TraceCheckUtils]: 102: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,961 INFO L290 TraceCheckUtils]: 103: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,961 INFO L290 TraceCheckUtils]: 104: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,962 INFO L290 TraceCheckUtils]: 105: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,962 INFO L290 TraceCheckUtils]: 106: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,962 INFO L290 TraceCheckUtils]: 107: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,963 INFO L290 TraceCheckUtils]: 108: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,963 INFO L290 TraceCheckUtils]: 109: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,963 INFO L290 TraceCheckUtils]: 110: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,964 INFO L290 TraceCheckUtils]: 111: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,964 INFO L290 TraceCheckUtils]: 112: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,964 INFO L290 TraceCheckUtils]: 113: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,965 INFO L290 TraceCheckUtils]: 114: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,965 INFO L290 TraceCheckUtils]: 115: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,965 INFO L290 TraceCheckUtils]: 116: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,966 INFO L290 TraceCheckUtils]: 117: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,966 INFO L290 TraceCheckUtils]: 118: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,966 INFO L290 TraceCheckUtils]: 119: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,967 INFO L290 TraceCheckUtils]: 120: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,967 INFO L290 TraceCheckUtils]: 121: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,967 INFO L290 TraceCheckUtils]: 122: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,968 INFO L290 TraceCheckUtils]: 123: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,968 INFO L290 TraceCheckUtils]: 124: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,969 INFO L290 TraceCheckUtils]: 125: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,969 INFO L290 TraceCheckUtils]: 126: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,969 INFO L290 TraceCheckUtils]: 127: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,970 INFO L290 TraceCheckUtils]: 128: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,970 INFO L290 TraceCheckUtils]: 129: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,970 INFO L290 TraceCheckUtils]: 130: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,971 INFO L290 TraceCheckUtils]: 131: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,971 INFO L290 TraceCheckUtils]: 132: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,971 INFO L290 TraceCheckUtils]: 133: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,972 INFO L290 TraceCheckUtils]: 134: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,972 INFO L290 TraceCheckUtils]: 135: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,972 INFO L290 TraceCheckUtils]: 136: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,973 INFO L290 TraceCheckUtils]: 137: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,973 INFO L290 TraceCheckUtils]: 138: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,973 INFO L290 TraceCheckUtils]: 139: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,974 INFO L290 TraceCheckUtils]: 140: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,974 INFO L290 TraceCheckUtils]: 141: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,974 INFO L290 TraceCheckUtils]: 142: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,975 INFO L290 TraceCheckUtils]: 143: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,975 INFO L290 TraceCheckUtils]: 144: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,975 INFO L290 TraceCheckUtils]: 145: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,976 INFO L290 TraceCheckUtils]: 146: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,976 INFO L290 TraceCheckUtils]: 147: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~j~0 < ~edgecount~0); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:27,976 INFO L290 TraceCheckUtils]: 148: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,977 INFO L290 TraceCheckUtils]: 149: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,977 INFO L290 TraceCheckUtils]: 150: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,977 INFO L290 TraceCheckUtils]: 151: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,978 INFO L290 TraceCheckUtils]: 152: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,978 INFO L290 TraceCheckUtils]: 153: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,978 INFO L290 TraceCheckUtils]: 154: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,979 INFO L290 TraceCheckUtils]: 155: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,979 INFO L290 TraceCheckUtils]: 156: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,980 INFO L290 TraceCheckUtils]: 157: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,980 INFO L290 TraceCheckUtils]: 158: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,980 INFO L290 TraceCheckUtils]: 159: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,981 INFO L290 TraceCheckUtils]: 160: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,981 INFO L290 TraceCheckUtils]: 161: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,981 INFO L290 TraceCheckUtils]: 162: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,982 INFO L290 TraceCheckUtils]: 163: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,982 INFO L290 TraceCheckUtils]: 164: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,982 INFO L290 TraceCheckUtils]: 165: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,983 INFO L290 TraceCheckUtils]: 166: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,983 INFO L290 TraceCheckUtils]: 167: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,983 INFO L290 TraceCheckUtils]: 168: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,984 INFO L290 TraceCheckUtils]: 169: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,984 INFO L290 TraceCheckUtils]: 170: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,984 INFO L290 TraceCheckUtils]: 171: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,985 INFO L290 TraceCheckUtils]: 172: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,985 INFO L290 TraceCheckUtils]: 173: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,985 INFO L290 TraceCheckUtils]: 174: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,986 INFO L290 TraceCheckUtils]: 175: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,986 INFO L290 TraceCheckUtils]: 176: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,986 INFO L290 TraceCheckUtils]: 177: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,987 INFO L290 TraceCheckUtils]: 178: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,987 INFO L290 TraceCheckUtils]: 179: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,987 INFO L290 TraceCheckUtils]: 180: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,988 INFO L290 TraceCheckUtils]: 181: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,988 INFO L290 TraceCheckUtils]: 182: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,988 INFO L290 TraceCheckUtils]: 183: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,989 INFO L290 TraceCheckUtils]: 184: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,989 INFO L290 TraceCheckUtils]: 185: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,990 INFO L290 TraceCheckUtils]: 186: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,990 INFO L290 TraceCheckUtils]: 187: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,990 INFO L290 TraceCheckUtils]: 188: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,991 INFO L290 TraceCheckUtils]: 189: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,991 INFO L290 TraceCheckUtils]: 190: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,991 INFO L290 TraceCheckUtils]: 191: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,992 INFO L290 TraceCheckUtils]: 192: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,992 INFO L290 TraceCheckUtils]: 193: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,992 INFO L290 TraceCheckUtils]: 194: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,993 INFO L290 TraceCheckUtils]: 195: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,993 INFO L290 TraceCheckUtils]: 196: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,993 INFO L290 TraceCheckUtils]: 197: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,994 INFO L290 TraceCheckUtils]: 198: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,994 INFO L290 TraceCheckUtils]: 199: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,994 INFO L290 TraceCheckUtils]: 200: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,995 INFO L290 TraceCheckUtils]: 201: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,995 INFO L290 TraceCheckUtils]: 202: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,995 INFO L290 TraceCheckUtils]: 203: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,996 INFO L290 TraceCheckUtils]: 204: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,996 INFO L290 TraceCheckUtils]: 205: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,996 INFO L290 TraceCheckUtils]: 206: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,997 INFO L290 TraceCheckUtils]: 207: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,997 INFO L290 TraceCheckUtils]: 208: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,997 INFO L290 TraceCheckUtils]: 209: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,998 INFO L290 TraceCheckUtils]: 210: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~j~0 < ~edgecount~0); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:27,998 INFO L290 TraceCheckUtils]: 211: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28102#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:27,998 INFO L290 TraceCheckUtils]: 212: Hoare triple {28102#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~i~0 < ~nodecount~0); {28094#false} is VALID [2022-04-08 09:00:27,998 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 09:00:27,998 INFO L290 TraceCheckUtils]: 214: Hoare triple {28094#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 09:00:27,999 INFO L290 TraceCheckUtils]: 215: Hoare triple {28094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28094#false} is VALID [2022-04-08 09:00:27,999 INFO L290 TraceCheckUtils]: 216: Hoare triple {28094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28094#false} is VALID [2022-04-08 09:00:27,999 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-08 09:00:27,999 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 09:00:27,999 INFO L290 TraceCheckUtils]: 219: Hoare triple {28094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 09:00:27,999 INFO L272 TraceCheckUtils]: 220: Hoare triple {28094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28094#false} is VALID [2022-04-08 09:00:27,999 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-08 09:00:27,999 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-08 09:00:27,999 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-08 09:00:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5538 backedges. 0 proven. 3732 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-04-08 09:00:28,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:28,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944304381] [2022-04-08 09:00:28,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944304381] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:28,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953378135] [2022-04-08 09:00:28,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:28,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:28,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:28,002 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:28,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 09:00:28,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:28,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:28,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:00:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:28,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:29,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28093#true} is VALID [2022-04-08 09:00:29,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {28093#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-08 09:00:29,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-08 09:00:29,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-08 09:00:29,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-08 09:00:29,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {28093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 09:00:29,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {28122#(<= 5 main_~nodecount~0)} ~i~0 := 0; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,701 INFO L290 TraceCheckUtils]: 45: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,702 INFO L290 TraceCheckUtils]: 48: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,702 INFO L290 TraceCheckUtils]: 49: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,703 INFO L290 TraceCheckUtils]: 52: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,704 INFO L290 TraceCheckUtils]: 53: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,705 INFO L290 TraceCheckUtils]: 55: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,705 INFO L290 TraceCheckUtils]: 56: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,705 INFO L290 TraceCheckUtils]: 57: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,706 INFO L290 TraceCheckUtils]: 58: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,706 INFO L290 TraceCheckUtils]: 59: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,706 INFO L290 TraceCheckUtils]: 60: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,707 INFO L290 TraceCheckUtils]: 62: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,707 INFO L290 TraceCheckUtils]: 63: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,708 INFO L290 TraceCheckUtils]: 64: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,709 INFO L290 TraceCheckUtils]: 66: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,709 INFO L290 TraceCheckUtils]: 67: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,709 INFO L290 TraceCheckUtils]: 68: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,710 INFO L290 TraceCheckUtils]: 69: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,711 INFO L290 TraceCheckUtils]: 72: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,711 INFO L290 TraceCheckUtils]: 73: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,711 INFO L290 TraceCheckUtils]: 74: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,712 INFO L290 TraceCheckUtils]: 75: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,712 INFO L290 TraceCheckUtils]: 76: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,712 INFO L290 TraceCheckUtils]: 77: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,713 INFO L290 TraceCheckUtils]: 78: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,714 INFO L290 TraceCheckUtils]: 81: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,714 INFO L290 TraceCheckUtils]: 82: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,716 INFO L290 TraceCheckUtils]: 83: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,717 INFO L290 TraceCheckUtils]: 86: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,717 INFO L290 TraceCheckUtils]: 87: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,717 INFO L290 TraceCheckUtils]: 88: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,718 INFO L290 TraceCheckUtils]: 89: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,718 INFO L290 TraceCheckUtils]: 90: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,719 INFO L290 TraceCheckUtils]: 91: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,719 INFO L290 TraceCheckUtils]: 92: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,719 INFO L290 TraceCheckUtils]: 93: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,720 INFO L290 TraceCheckUtils]: 94: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,720 INFO L290 TraceCheckUtils]: 95: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,720 INFO L290 TraceCheckUtils]: 96: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,721 INFO L290 TraceCheckUtils]: 97: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,721 INFO L290 TraceCheckUtils]: 98: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,722 INFO L290 TraceCheckUtils]: 99: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,722 INFO L290 TraceCheckUtils]: 100: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,722 INFO L290 TraceCheckUtils]: 101: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,723 INFO L290 TraceCheckUtils]: 102: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,723 INFO L290 TraceCheckUtils]: 103: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,723 INFO L290 TraceCheckUtils]: 104: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,724 INFO L290 TraceCheckUtils]: 105: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,724 INFO L290 TraceCheckUtils]: 106: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,725 INFO L290 TraceCheckUtils]: 107: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,725 INFO L290 TraceCheckUtils]: 108: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,725 INFO L290 TraceCheckUtils]: 109: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,726 INFO L290 TraceCheckUtils]: 110: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,726 INFO L290 TraceCheckUtils]: 111: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,726 INFO L290 TraceCheckUtils]: 112: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,727 INFO L290 TraceCheckUtils]: 113: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,727 INFO L290 TraceCheckUtils]: 114: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,727 INFO L290 TraceCheckUtils]: 115: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,728 INFO L290 TraceCheckUtils]: 116: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,728 INFO L290 TraceCheckUtils]: 117: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,729 INFO L290 TraceCheckUtils]: 118: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,729 INFO L290 TraceCheckUtils]: 119: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,729 INFO L290 TraceCheckUtils]: 120: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,730 INFO L290 TraceCheckUtils]: 121: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,730 INFO L290 TraceCheckUtils]: 122: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,730 INFO L290 TraceCheckUtils]: 123: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,731 INFO L290 TraceCheckUtils]: 124: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,731 INFO L290 TraceCheckUtils]: 125: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,732 INFO L290 TraceCheckUtils]: 126: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,732 INFO L290 TraceCheckUtils]: 127: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,732 INFO L290 TraceCheckUtils]: 128: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,733 INFO L290 TraceCheckUtils]: 129: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,733 INFO L290 TraceCheckUtils]: 130: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,733 INFO L290 TraceCheckUtils]: 131: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,734 INFO L290 TraceCheckUtils]: 132: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,734 INFO L290 TraceCheckUtils]: 133: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,735 INFO L290 TraceCheckUtils]: 134: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,735 INFO L290 TraceCheckUtils]: 135: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,735 INFO L290 TraceCheckUtils]: 136: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,736 INFO L290 TraceCheckUtils]: 137: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,736 INFO L290 TraceCheckUtils]: 138: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,737 INFO L290 TraceCheckUtils]: 139: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,737 INFO L290 TraceCheckUtils]: 140: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,737 INFO L290 TraceCheckUtils]: 141: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,738 INFO L290 TraceCheckUtils]: 142: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,738 INFO L290 TraceCheckUtils]: 143: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,739 INFO L290 TraceCheckUtils]: 144: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,739 INFO L290 TraceCheckUtils]: 145: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,739 INFO L290 TraceCheckUtils]: 146: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,740 INFO L290 TraceCheckUtils]: 147: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,740 INFO L290 TraceCheckUtils]: 148: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,740 INFO L290 TraceCheckUtils]: 149: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,741 INFO L290 TraceCheckUtils]: 150: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,741 INFO L290 TraceCheckUtils]: 151: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,741 INFO L290 TraceCheckUtils]: 152: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,742 INFO L290 TraceCheckUtils]: 153: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,742 INFO L290 TraceCheckUtils]: 154: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,742 INFO L290 TraceCheckUtils]: 155: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,743 INFO L290 TraceCheckUtils]: 156: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,743 INFO L290 TraceCheckUtils]: 157: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,744 INFO L290 TraceCheckUtils]: 158: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,744 INFO L290 TraceCheckUtils]: 159: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,744 INFO L290 TraceCheckUtils]: 160: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,745 INFO L290 TraceCheckUtils]: 161: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,745 INFO L290 TraceCheckUtils]: 162: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,745 INFO L290 TraceCheckUtils]: 163: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,746 INFO L290 TraceCheckUtils]: 164: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,746 INFO L290 TraceCheckUtils]: 165: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,746 INFO L290 TraceCheckUtils]: 166: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,747 INFO L290 TraceCheckUtils]: 167: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,747 INFO L290 TraceCheckUtils]: 168: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,748 INFO L290 TraceCheckUtils]: 169: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,748 INFO L290 TraceCheckUtils]: 170: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,748 INFO L290 TraceCheckUtils]: 171: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,749 INFO L290 TraceCheckUtils]: 172: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,749 INFO L290 TraceCheckUtils]: 173: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,749 INFO L290 TraceCheckUtils]: 174: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,750 INFO L290 TraceCheckUtils]: 175: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,750 INFO L290 TraceCheckUtils]: 176: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,750 INFO L290 TraceCheckUtils]: 177: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,751 INFO L290 TraceCheckUtils]: 178: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,751 INFO L290 TraceCheckUtils]: 179: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,752 INFO L290 TraceCheckUtils]: 180: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,752 INFO L290 TraceCheckUtils]: 181: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,752 INFO L290 TraceCheckUtils]: 182: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,753 INFO L290 TraceCheckUtils]: 183: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,753 INFO L290 TraceCheckUtils]: 184: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,754 INFO L290 TraceCheckUtils]: 185: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,754 INFO L290 TraceCheckUtils]: 186: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,754 INFO L290 TraceCheckUtils]: 187: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,755 INFO L290 TraceCheckUtils]: 188: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,755 INFO L290 TraceCheckUtils]: 189: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,755 INFO L290 TraceCheckUtils]: 190: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,756 INFO L290 TraceCheckUtils]: 191: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,756 INFO L290 TraceCheckUtils]: 192: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,757 INFO L290 TraceCheckUtils]: 193: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,757 INFO L290 TraceCheckUtils]: 194: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,757 INFO L290 TraceCheckUtils]: 195: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,758 INFO L290 TraceCheckUtils]: 196: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,758 INFO L290 TraceCheckUtils]: 197: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,758 INFO L290 TraceCheckUtils]: 198: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,759 INFO L290 TraceCheckUtils]: 199: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,759 INFO L290 TraceCheckUtils]: 200: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,759 INFO L290 TraceCheckUtils]: 201: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,760 INFO L290 TraceCheckUtils]: 202: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,761 INFO L290 TraceCheckUtils]: 203: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,761 INFO L290 TraceCheckUtils]: 204: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,762 INFO L290 TraceCheckUtils]: 205: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,762 INFO L290 TraceCheckUtils]: 206: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,762 INFO L290 TraceCheckUtils]: 207: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,763 INFO L290 TraceCheckUtils]: 208: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,763 INFO L290 TraceCheckUtils]: 209: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,763 INFO L290 TraceCheckUtils]: 210: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 09:00:29,764 INFO L290 TraceCheckUtils]: 211: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28744#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:29,764 INFO L290 TraceCheckUtils]: 212: Hoare triple {28744#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} assume !(~i~0 < ~nodecount~0); {28094#false} is VALID [2022-04-08 09:00:29,764 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 09:00:29,764 INFO L290 TraceCheckUtils]: 214: Hoare triple {28094#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 09:00:29,764 INFO L290 TraceCheckUtils]: 215: Hoare triple {28094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28094#false} is VALID [2022-04-08 09:00:29,764 INFO L290 TraceCheckUtils]: 216: Hoare triple {28094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28094#false} is VALID [2022-04-08 09:00:29,764 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-08 09:00:29,764 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 09:00:29,764 INFO L290 TraceCheckUtils]: 219: Hoare triple {28094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 09:00:29,764 INFO L272 TraceCheckUtils]: 220: Hoare triple {28094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28094#false} is VALID [2022-04-08 09:00:29,765 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-08 09:00:29,765 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-08 09:00:29,765 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-08 09:00:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5538 backedges. 0 proven. 3732 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-04-08 09:00:29,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:30,526 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-08 09:00:30,526 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-08 09:00:30,527 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-08 09:00:30,527 INFO L272 TraceCheckUtils]: 220: Hoare triple {28094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28094#false} is VALID [2022-04-08 09:00:30,527 INFO L290 TraceCheckUtils]: 219: Hoare triple {28094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 09:00:30,527 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 09:00:30,527 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-08 09:00:30,527 INFO L290 TraceCheckUtils]: 216: Hoare triple {28094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28094#false} is VALID [2022-04-08 09:00:30,527 INFO L290 TraceCheckUtils]: 215: Hoare triple {28094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28094#false} is VALID [2022-04-08 09:00:30,527 INFO L290 TraceCheckUtils]: 214: Hoare triple {28094#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 09:00:30,527 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 09:00:30,527 INFO L290 TraceCheckUtils]: 212: Hoare triple {28814#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {28094#false} is VALID [2022-04-08 09:00:30,528 INFO L290 TraceCheckUtils]: 211: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28814#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,528 INFO L290 TraceCheckUtils]: 210: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,528 INFO L290 TraceCheckUtils]: 209: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,528 INFO L290 TraceCheckUtils]: 208: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,529 INFO L290 TraceCheckUtils]: 207: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,529 INFO L290 TraceCheckUtils]: 206: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,529 INFO L290 TraceCheckUtils]: 205: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,529 INFO L290 TraceCheckUtils]: 204: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,530 INFO L290 TraceCheckUtils]: 203: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,530 INFO L290 TraceCheckUtils]: 202: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,530 INFO L290 TraceCheckUtils]: 201: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,530 INFO L290 TraceCheckUtils]: 200: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,530 INFO L290 TraceCheckUtils]: 199: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,531 INFO L290 TraceCheckUtils]: 198: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,531 INFO L290 TraceCheckUtils]: 197: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,531 INFO L290 TraceCheckUtils]: 196: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,531 INFO L290 TraceCheckUtils]: 195: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,532 INFO L290 TraceCheckUtils]: 194: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,532 INFO L290 TraceCheckUtils]: 193: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,532 INFO L290 TraceCheckUtils]: 192: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,532 INFO L290 TraceCheckUtils]: 191: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,533 INFO L290 TraceCheckUtils]: 190: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,543 INFO L290 TraceCheckUtils]: 189: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,543 INFO L290 TraceCheckUtils]: 188: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,543 INFO L290 TraceCheckUtils]: 187: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,544 INFO L290 TraceCheckUtils]: 186: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,544 INFO L290 TraceCheckUtils]: 185: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,544 INFO L290 TraceCheckUtils]: 184: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,544 INFO L290 TraceCheckUtils]: 183: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,545 INFO L290 TraceCheckUtils]: 182: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,545 INFO L290 TraceCheckUtils]: 181: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,545 INFO L290 TraceCheckUtils]: 180: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,545 INFO L290 TraceCheckUtils]: 179: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,546 INFO L290 TraceCheckUtils]: 178: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,546 INFO L290 TraceCheckUtils]: 177: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,546 INFO L290 TraceCheckUtils]: 176: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,546 INFO L290 TraceCheckUtils]: 175: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,546 INFO L290 TraceCheckUtils]: 174: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,547 INFO L290 TraceCheckUtils]: 173: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,547 INFO L290 TraceCheckUtils]: 172: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,547 INFO L290 TraceCheckUtils]: 171: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,547 INFO L290 TraceCheckUtils]: 170: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,548 INFO L290 TraceCheckUtils]: 169: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,548 INFO L290 TraceCheckUtils]: 168: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,548 INFO L290 TraceCheckUtils]: 167: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,548 INFO L290 TraceCheckUtils]: 166: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,549 INFO L290 TraceCheckUtils]: 165: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,549 INFO L290 TraceCheckUtils]: 164: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,549 INFO L290 TraceCheckUtils]: 163: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,549 INFO L290 TraceCheckUtils]: 162: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,550 INFO L290 TraceCheckUtils]: 161: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,550 INFO L290 TraceCheckUtils]: 160: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,550 INFO L290 TraceCheckUtils]: 159: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,550 INFO L290 TraceCheckUtils]: 158: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,551 INFO L290 TraceCheckUtils]: 157: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,551 INFO L290 TraceCheckUtils]: 156: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,551 INFO L290 TraceCheckUtils]: 155: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,551 INFO L290 TraceCheckUtils]: 154: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,552 INFO L290 TraceCheckUtils]: 153: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,552 INFO L290 TraceCheckUtils]: 152: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,552 INFO L290 TraceCheckUtils]: 151: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,552 INFO L290 TraceCheckUtils]: 150: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,552 INFO L290 TraceCheckUtils]: 149: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,553 INFO L290 TraceCheckUtils]: 148: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,553 INFO L290 TraceCheckUtils]: 147: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,553 INFO L290 TraceCheckUtils]: 146: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,554 INFO L290 TraceCheckUtils]: 145: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,554 INFO L290 TraceCheckUtils]: 144: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,554 INFO L290 TraceCheckUtils]: 143: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,554 INFO L290 TraceCheckUtils]: 142: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,555 INFO L290 TraceCheckUtils]: 141: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,555 INFO L290 TraceCheckUtils]: 140: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,555 INFO L290 TraceCheckUtils]: 139: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,555 INFO L290 TraceCheckUtils]: 138: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,556 INFO L290 TraceCheckUtils]: 137: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,556 INFO L290 TraceCheckUtils]: 136: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,556 INFO L290 TraceCheckUtils]: 135: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,556 INFO L290 TraceCheckUtils]: 134: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,556 INFO L290 TraceCheckUtils]: 133: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,557 INFO L290 TraceCheckUtils]: 132: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,557 INFO L290 TraceCheckUtils]: 131: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,557 INFO L290 TraceCheckUtils]: 130: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,557 INFO L290 TraceCheckUtils]: 129: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,558 INFO L290 TraceCheckUtils]: 128: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,558 INFO L290 TraceCheckUtils]: 127: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,558 INFO L290 TraceCheckUtils]: 126: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,558 INFO L290 TraceCheckUtils]: 125: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,559 INFO L290 TraceCheckUtils]: 124: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,559 INFO L290 TraceCheckUtils]: 123: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,559 INFO L290 TraceCheckUtils]: 122: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,559 INFO L290 TraceCheckUtils]: 121: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,560 INFO L290 TraceCheckUtils]: 120: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,560 INFO L290 TraceCheckUtils]: 119: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,560 INFO L290 TraceCheckUtils]: 118: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,560 INFO L290 TraceCheckUtils]: 117: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,561 INFO L290 TraceCheckUtils]: 116: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,561 INFO L290 TraceCheckUtils]: 115: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,561 INFO L290 TraceCheckUtils]: 114: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,561 INFO L290 TraceCheckUtils]: 113: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,561 INFO L290 TraceCheckUtils]: 112: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,562 INFO L290 TraceCheckUtils]: 111: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,562 INFO L290 TraceCheckUtils]: 110: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,562 INFO L290 TraceCheckUtils]: 109: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,562 INFO L290 TraceCheckUtils]: 108: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,563 INFO L290 TraceCheckUtils]: 107: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,563 INFO L290 TraceCheckUtils]: 106: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,563 INFO L290 TraceCheckUtils]: 105: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,563 INFO L290 TraceCheckUtils]: 104: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,564 INFO L290 TraceCheckUtils]: 103: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,564 INFO L290 TraceCheckUtils]: 102: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,564 INFO L290 TraceCheckUtils]: 101: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,564 INFO L290 TraceCheckUtils]: 100: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,565 INFO L290 TraceCheckUtils]: 99: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,565 INFO L290 TraceCheckUtils]: 98: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,565 INFO L290 TraceCheckUtils]: 97: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,565 INFO L290 TraceCheckUtils]: 96: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,566 INFO L290 TraceCheckUtils]: 95: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,566 INFO L290 TraceCheckUtils]: 94: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,566 INFO L290 TraceCheckUtils]: 93: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,566 INFO L290 TraceCheckUtils]: 92: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,566 INFO L290 TraceCheckUtils]: 91: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,567 INFO L290 TraceCheckUtils]: 90: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,567 INFO L290 TraceCheckUtils]: 89: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,567 INFO L290 TraceCheckUtils]: 88: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,567 INFO L290 TraceCheckUtils]: 87: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,568 INFO L290 TraceCheckUtils]: 86: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,568 INFO L290 TraceCheckUtils]: 85: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,568 INFO L290 TraceCheckUtils]: 84: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,569 INFO L290 TraceCheckUtils]: 83: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,569 INFO L290 TraceCheckUtils]: 82: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,569 INFO L290 TraceCheckUtils]: 81: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,569 INFO L290 TraceCheckUtils]: 80: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,570 INFO L290 TraceCheckUtils]: 78: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,570 INFO L290 TraceCheckUtils]: 77: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,570 INFO L290 TraceCheckUtils]: 76: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,570 INFO L290 TraceCheckUtils]: 75: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,571 INFO L290 TraceCheckUtils]: 74: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,571 INFO L290 TraceCheckUtils]: 73: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,571 INFO L290 TraceCheckUtils]: 72: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,571 INFO L290 TraceCheckUtils]: 71: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,572 INFO L290 TraceCheckUtils]: 70: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,572 INFO L290 TraceCheckUtils]: 69: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,572 INFO L290 TraceCheckUtils]: 68: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,572 INFO L290 TraceCheckUtils]: 67: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,573 INFO L290 TraceCheckUtils]: 66: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,573 INFO L290 TraceCheckUtils]: 65: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,573 INFO L290 TraceCheckUtils]: 64: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,573 INFO L290 TraceCheckUtils]: 63: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,574 INFO L290 TraceCheckUtils]: 62: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,574 INFO L290 TraceCheckUtils]: 61: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,575 INFO L290 TraceCheckUtils]: 57: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,575 INFO L290 TraceCheckUtils]: 56: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,575 INFO L290 TraceCheckUtils]: 55: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,577 INFO L290 TraceCheckUtils]: 49: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,577 INFO L290 TraceCheckUtils]: 48: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,577 INFO L290 TraceCheckUtils]: 47: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {29388#(< 3 main_~nodecount~0)} ~i~0 := 0; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 09:00:30,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {29388#(< 3 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {28093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 09:00:30,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-08 09:00:30,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-08 09:00:30,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-08 09:00:30,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {28093#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-08 09:00:30,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28093#true} is VALID [2022-04-08 09:00:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5538 backedges. 0 proven. 3732 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-04-08 09:00:30,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953378135] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:30,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:30,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-08 09:00:30,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:30,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [55804718] [2022-04-08 09:00:30,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [55804718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:30,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:30,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:00:30,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948497412] [2022-04-08 09:00:30,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:30,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 224 [2022-04-08 09:00:30,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:30,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:30,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:30,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:00:30,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:00:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:00:30,628 INFO L87 Difference]: Start difference. First operand 229 states and 296 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:32,280 INFO L93 Difference]: Finished difference Result 400 states and 518 transitions. [2022-04-08 09:00:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:00:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 224 [2022-04-08 09:00:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-08 09:00:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-08 09:00:32,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2022-04-08 09:00:32,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:32,381 INFO L225 Difference]: With dead ends: 400 [2022-04-08 09:00:32,381 INFO L226 Difference]: Without dead ends: 384 [2022-04-08 09:00:32,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:00:32,381 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 200 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:32,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 34 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-04-08 09:00:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 292. [2022-04-08 09:00:33,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:33,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:33,416 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:33,417 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:33,422 INFO L93 Difference]: Finished difference Result 384 states and 500 transitions. [2022-04-08 09:00:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 500 transitions. [2022-04-08 09:00:33,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:33,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:33,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 384 states. [2022-04-08 09:00:33,423 INFO L87 Difference]: Start difference. First operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 384 states. [2022-04-08 09:00:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:33,429 INFO L93 Difference]: Finished difference Result 384 states and 500 transitions. [2022-04-08 09:00:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 500 transitions. [2022-04-08 09:00:33,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:33,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:33,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:33,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 380 transitions. [2022-04-08 09:00:33,434 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 380 transitions. Word has length 224 [2022-04-08 09:00:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:33,434 INFO L478 AbstractCegarLoop]: Abstraction has 292 states and 380 transitions. [2022-04-08 09:00:33,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:33,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 292 states and 380 transitions. [2022-04-08 09:00:34,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 380 transitions. [2022-04-08 09:00:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-04-08 09:00:34,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:34,069 INFO L499 BasicCegarLoop]: trace histogram [80, 80, 80, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:34,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:34,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:34,275 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:34,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:34,276 INFO L85 PathProgramCache]: Analyzing trace with hash -381796264, now seen corresponding path program 51 times [2022-04-08 09:00:34,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:34,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [112529782] [2022-04-08 09:00:34,279 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:34,279 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:34,279 INFO L85 PathProgramCache]: Analyzing trace with hash -381796264, now seen corresponding path program 52 times [2022-04-08 09:00:34,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:34,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4152667] [2022-04-08 09:00:34,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:34,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:34,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:34,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {31630#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-08 09:00:34,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-08 09:00:34,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-08 09:00:34,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31630#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:34,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {31630#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-08 09:00:34,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-08 09:00:34,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-08 09:00:34,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-08 09:00:34,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 09:00:34,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,567 INFO L290 TraceCheckUtils]: 40: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,571 INFO L290 TraceCheckUtils]: 51: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,571 INFO L290 TraceCheckUtils]: 52: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,572 INFO L290 TraceCheckUtils]: 53: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,572 INFO L290 TraceCheckUtils]: 54: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,572 INFO L290 TraceCheckUtils]: 55: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,576 INFO L290 TraceCheckUtils]: 64: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,576 INFO L290 TraceCheckUtils]: 65: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,576 INFO L290 TraceCheckUtils]: 66: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,577 INFO L290 TraceCheckUtils]: 67: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,577 INFO L290 TraceCheckUtils]: 68: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,577 INFO L290 TraceCheckUtils]: 69: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,578 INFO L290 TraceCheckUtils]: 70: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,578 INFO L290 TraceCheckUtils]: 71: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,578 INFO L290 TraceCheckUtils]: 72: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,579 INFO L290 TraceCheckUtils]: 73: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,579 INFO L290 TraceCheckUtils]: 74: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,579 INFO L290 TraceCheckUtils]: 75: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,580 INFO L290 TraceCheckUtils]: 76: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,580 INFO L290 TraceCheckUtils]: 77: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,580 INFO L290 TraceCheckUtils]: 78: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,581 INFO L290 TraceCheckUtils]: 79: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,581 INFO L290 TraceCheckUtils]: 80: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,581 INFO L290 TraceCheckUtils]: 81: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,582 INFO L290 TraceCheckUtils]: 82: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,582 INFO L290 TraceCheckUtils]: 83: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,582 INFO L290 TraceCheckUtils]: 84: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:34,583 INFO L290 TraceCheckUtils]: 85: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,583 INFO L290 TraceCheckUtils]: 86: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,584 INFO L290 TraceCheckUtils]: 87: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,584 INFO L290 TraceCheckUtils]: 88: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,584 INFO L290 TraceCheckUtils]: 89: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,585 INFO L290 TraceCheckUtils]: 90: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,585 INFO L290 TraceCheckUtils]: 91: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,585 INFO L290 TraceCheckUtils]: 92: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,586 INFO L290 TraceCheckUtils]: 93: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,586 INFO L290 TraceCheckUtils]: 94: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,586 INFO L290 TraceCheckUtils]: 95: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,587 INFO L290 TraceCheckUtils]: 96: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,587 INFO L290 TraceCheckUtils]: 97: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,587 INFO L290 TraceCheckUtils]: 98: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,588 INFO L290 TraceCheckUtils]: 99: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,588 INFO L290 TraceCheckUtils]: 100: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,588 INFO L290 TraceCheckUtils]: 101: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,589 INFO L290 TraceCheckUtils]: 102: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,589 INFO L290 TraceCheckUtils]: 103: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,589 INFO L290 TraceCheckUtils]: 104: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,590 INFO L290 TraceCheckUtils]: 105: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,590 INFO L290 TraceCheckUtils]: 106: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,591 INFO L290 TraceCheckUtils]: 107: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,591 INFO L290 TraceCheckUtils]: 108: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,591 INFO L290 TraceCheckUtils]: 109: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,592 INFO L290 TraceCheckUtils]: 110: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,592 INFO L290 TraceCheckUtils]: 111: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,592 INFO L290 TraceCheckUtils]: 112: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,593 INFO L290 TraceCheckUtils]: 113: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,593 INFO L290 TraceCheckUtils]: 114: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,593 INFO L290 TraceCheckUtils]: 115: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,594 INFO L290 TraceCheckUtils]: 116: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,594 INFO L290 TraceCheckUtils]: 117: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,594 INFO L290 TraceCheckUtils]: 118: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,595 INFO L290 TraceCheckUtils]: 119: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,595 INFO L290 TraceCheckUtils]: 120: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,595 INFO L290 TraceCheckUtils]: 121: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,596 INFO L290 TraceCheckUtils]: 122: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,596 INFO L290 TraceCheckUtils]: 123: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,596 INFO L290 TraceCheckUtils]: 124: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,597 INFO L290 TraceCheckUtils]: 125: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,597 INFO L290 TraceCheckUtils]: 126: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,597 INFO L290 TraceCheckUtils]: 127: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,598 INFO L290 TraceCheckUtils]: 128: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,598 INFO L290 TraceCheckUtils]: 129: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,598 INFO L290 TraceCheckUtils]: 130: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,599 INFO L290 TraceCheckUtils]: 131: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,599 INFO L290 TraceCheckUtils]: 132: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,599 INFO L290 TraceCheckUtils]: 133: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,600 INFO L290 TraceCheckUtils]: 134: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,600 INFO L290 TraceCheckUtils]: 135: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,601 INFO L290 TraceCheckUtils]: 136: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,601 INFO L290 TraceCheckUtils]: 137: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,601 INFO L290 TraceCheckUtils]: 138: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,602 INFO L290 TraceCheckUtils]: 139: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,602 INFO L290 TraceCheckUtils]: 140: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,602 INFO L290 TraceCheckUtils]: 141: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,603 INFO L290 TraceCheckUtils]: 142: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,603 INFO L290 TraceCheckUtils]: 143: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,603 INFO L290 TraceCheckUtils]: 144: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,604 INFO L290 TraceCheckUtils]: 145: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,604 INFO L290 TraceCheckUtils]: 146: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,604 INFO L290 TraceCheckUtils]: 147: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~j~0 < ~edgecount~0); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,605 INFO L290 TraceCheckUtils]: 148: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,605 INFO L290 TraceCheckUtils]: 149: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,605 INFO L290 TraceCheckUtils]: 150: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,606 INFO L290 TraceCheckUtils]: 151: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,606 INFO L290 TraceCheckUtils]: 152: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,606 INFO L290 TraceCheckUtils]: 153: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,607 INFO L290 TraceCheckUtils]: 154: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,607 INFO L290 TraceCheckUtils]: 155: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,607 INFO L290 TraceCheckUtils]: 156: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,608 INFO L290 TraceCheckUtils]: 157: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,608 INFO L290 TraceCheckUtils]: 158: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,608 INFO L290 TraceCheckUtils]: 159: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,609 INFO L290 TraceCheckUtils]: 160: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,609 INFO L290 TraceCheckUtils]: 161: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,609 INFO L290 TraceCheckUtils]: 162: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,610 INFO L290 TraceCheckUtils]: 163: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,610 INFO L290 TraceCheckUtils]: 164: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,611 INFO L290 TraceCheckUtils]: 165: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,611 INFO L290 TraceCheckUtils]: 166: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,611 INFO L290 TraceCheckUtils]: 167: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,612 INFO L290 TraceCheckUtils]: 168: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,612 INFO L290 TraceCheckUtils]: 169: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,612 INFO L290 TraceCheckUtils]: 170: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,613 INFO L290 TraceCheckUtils]: 171: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,613 INFO L290 TraceCheckUtils]: 172: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,613 INFO L290 TraceCheckUtils]: 173: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,614 INFO L290 TraceCheckUtils]: 174: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,614 INFO L290 TraceCheckUtils]: 175: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,614 INFO L290 TraceCheckUtils]: 176: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,615 INFO L290 TraceCheckUtils]: 177: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,615 INFO L290 TraceCheckUtils]: 178: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,615 INFO L290 TraceCheckUtils]: 179: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,616 INFO L290 TraceCheckUtils]: 180: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,616 INFO L290 TraceCheckUtils]: 181: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,616 INFO L290 TraceCheckUtils]: 182: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,617 INFO L290 TraceCheckUtils]: 183: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,617 INFO L290 TraceCheckUtils]: 184: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,617 INFO L290 TraceCheckUtils]: 185: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,618 INFO L290 TraceCheckUtils]: 186: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,618 INFO L290 TraceCheckUtils]: 187: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,618 INFO L290 TraceCheckUtils]: 188: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,619 INFO L290 TraceCheckUtils]: 189: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,619 INFO L290 TraceCheckUtils]: 190: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,619 INFO L290 TraceCheckUtils]: 191: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,620 INFO L290 TraceCheckUtils]: 192: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,620 INFO L290 TraceCheckUtils]: 193: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,621 INFO L290 TraceCheckUtils]: 194: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,621 INFO L290 TraceCheckUtils]: 195: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,621 INFO L290 TraceCheckUtils]: 196: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,622 INFO L290 TraceCheckUtils]: 197: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,622 INFO L290 TraceCheckUtils]: 198: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,622 INFO L290 TraceCheckUtils]: 199: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,623 INFO L290 TraceCheckUtils]: 200: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,623 INFO L290 TraceCheckUtils]: 201: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,623 INFO L290 TraceCheckUtils]: 202: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,624 INFO L290 TraceCheckUtils]: 203: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,624 INFO L290 TraceCheckUtils]: 204: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,624 INFO L290 TraceCheckUtils]: 205: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,625 INFO L290 TraceCheckUtils]: 206: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,625 INFO L290 TraceCheckUtils]: 207: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,625 INFO L290 TraceCheckUtils]: 208: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,626 INFO L290 TraceCheckUtils]: 209: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,626 INFO L290 TraceCheckUtils]: 210: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~j~0 < ~edgecount~0); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:34,626 INFO L290 TraceCheckUtils]: 211: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,627 INFO L290 TraceCheckUtils]: 212: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,627 INFO L290 TraceCheckUtils]: 213: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,627 INFO L290 TraceCheckUtils]: 214: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,628 INFO L290 TraceCheckUtils]: 215: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,628 INFO L290 TraceCheckUtils]: 216: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,629 INFO L290 TraceCheckUtils]: 217: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,629 INFO L290 TraceCheckUtils]: 218: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,629 INFO L290 TraceCheckUtils]: 219: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,630 INFO L290 TraceCheckUtils]: 220: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,630 INFO L290 TraceCheckUtils]: 221: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,630 INFO L290 TraceCheckUtils]: 222: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,631 INFO L290 TraceCheckUtils]: 223: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,631 INFO L290 TraceCheckUtils]: 224: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,631 INFO L290 TraceCheckUtils]: 225: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,632 INFO L290 TraceCheckUtils]: 226: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,632 INFO L290 TraceCheckUtils]: 227: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,633 INFO L290 TraceCheckUtils]: 228: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,633 INFO L290 TraceCheckUtils]: 229: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,633 INFO L290 TraceCheckUtils]: 230: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,634 INFO L290 TraceCheckUtils]: 231: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,634 INFO L290 TraceCheckUtils]: 232: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,634 INFO L290 TraceCheckUtils]: 233: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,635 INFO L290 TraceCheckUtils]: 234: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,635 INFO L290 TraceCheckUtils]: 235: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,635 INFO L290 TraceCheckUtils]: 236: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,636 INFO L290 TraceCheckUtils]: 237: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,636 INFO L290 TraceCheckUtils]: 238: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,636 INFO L290 TraceCheckUtils]: 239: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,637 INFO L290 TraceCheckUtils]: 240: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,637 INFO L290 TraceCheckUtils]: 241: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,638 INFO L290 TraceCheckUtils]: 242: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,638 INFO L290 TraceCheckUtils]: 243: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,638 INFO L290 TraceCheckUtils]: 244: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,639 INFO L290 TraceCheckUtils]: 245: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,639 INFO L290 TraceCheckUtils]: 246: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,639 INFO L290 TraceCheckUtils]: 247: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,640 INFO L290 TraceCheckUtils]: 248: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,640 INFO L290 TraceCheckUtils]: 249: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,640 INFO L290 TraceCheckUtils]: 250: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,641 INFO L290 TraceCheckUtils]: 251: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,641 INFO L290 TraceCheckUtils]: 252: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,641 INFO L290 TraceCheckUtils]: 253: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,642 INFO L290 TraceCheckUtils]: 254: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,642 INFO L290 TraceCheckUtils]: 255: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,643 INFO L290 TraceCheckUtils]: 256: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,643 INFO L290 TraceCheckUtils]: 257: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,643 INFO L290 TraceCheckUtils]: 258: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,644 INFO L290 TraceCheckUtils]: 259: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,644 INFO L290 TraceCheckUtils]: 260: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,644 INFO L290 TraceCheckUtils]: 261: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,645 INFO L290 TraceCheckUtils]: 262: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,645 INFO L290 TraceCheckUtils]: 263: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,645 INFO L290 TraceCheckUtils]: 264: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,646 INFO L290 TraceCheckUtils]: 265: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,646 INFO L290 TraceCheckUtils]: 266: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,646 INFO L290 TraceCheckUtils]: 267: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,647 INFO L290 TraceCheckUtils]: 268: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,647 INFO L290 TraceCheckUtils]: 269: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,647 INFO L290 TraceCheckUtils]: 270: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,648 INFO L290 TraceCheckUtils]: 271: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,648 INFO L290 TraceCheckUtils]: 272: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,648 INFO L290 TraceCheckUtils]: 273: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~j~0 < ~edgecount~0); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:34,649 INFO L290 TraceCheckUtils]: 274: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31629#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 09:00:34,649 INFO L290 TraceCheckUtils]: 275: Hoare triple {31629#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {31620#false} is VALID [2022-04-08 09:00:34,649 INFO L290 TraceCheckUtils]: 276: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-08 09:00:34,649 INFO L290 TraceCheckUtils]: 277: Hoare triple {31620#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-08 09:00:34,649 INFO L290 TraceCheckUtils]: 278: Hoare triple {31620#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {31620#false} is VALID [2022-04-08 09:00:34,649 INFO L290 TraceCheckUtils]: 279: Hoare triple {31620#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {31620#false} is VALID [2022-04-08 09:00:34,649 INFO L290 TraceCheckUtils]: 280: Hoare triple {31620#false} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-08 09:00:34,649 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-08 09:00:34,649 INFO L290 TraceCheckUtils]: 282: Hoare triple {31620#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-08 09:00:34,649 INFO L272 TraceCheckUtils]: 283: Hoare triple {31620#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {31620#false} is VALID [2022-04-08 09:00:34,649 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-08 09:00:34,650 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-08 09:00:34,650 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-08 09:00:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2396 trivial. 0 not checked. [2022-04-08 09:00:34,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:34,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4152667] [2022-04-08 09:00:34,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4152667] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:34,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936982215] [2022-04-08 09:00:34,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:34,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:34,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:34,655 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:34,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 09:00:35,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:35,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:35,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 09:00:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:35,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:36,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-08 09:00:36,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 09:00:36,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {31619#true} assume !(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:36,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {31619#true} ~i~0 := 0; {31619#true} is VALID [2022-04-08 09:00:36,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:36,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {31703#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:36,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {31703#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:36,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {31703#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31713#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:36,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {31713#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31713#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:36,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {31713#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31713#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:36,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {31713#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31723#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:36,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {31723#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31723#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:36,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {31723#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31723#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:36,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {31723#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31733#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:36,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {31733#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31733#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:36,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {31733#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31733#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:36,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {31733#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31743#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:36,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {31743#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31743#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:36,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {31743#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31743#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:36,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {31743#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31753#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:36,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {31753#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31753#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:36,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {31753#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31753#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:36,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {31753#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31763#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:36,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {31763#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31763#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:36,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {31763#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31763#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:36,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {31763#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31773#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:36,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {31773#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31773#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:36,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {31773#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31773#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:36,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {31773#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31783#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:36,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {31783#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31783#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:36,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {31783#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31783#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:36,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {31783#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31793#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:36,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {31793#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31793#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:36,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {31793#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31793#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:36,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {31793#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31803#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:36,337 INFO L290 TraceCheckUtils]: 54: Hoare triple {31803#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31803#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:36,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {31803#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31803#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:36,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {31803#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31813#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:36,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {31813#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31813#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:36,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {31813#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31813#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:36,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {31813#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31823#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:36,339 INFO L290 TraceCheckUtils]: 60: Hoare triple {31823#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31823#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:36,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {31823#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31823#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:36,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {31823#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31833#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:36,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {31833#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31833#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:36,340 INFO L290 TraceCheckUtils]: 64: Hoare triple {31833#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31833#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:36,341 INFO L290 TraceCheckUtils]: 65: Hoare triple {31833#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31843#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:36,356 INFO L290 TraceCheckUtils]: 66: Hoare triple {31843#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31843#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:36,356 INFO L290 TraceCheckUtils]: 67: Hoare triple {31843#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31843#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:36,357 INFO L290 TraceCheckUtils]: 68: Hoare triple {31843#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31853#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:36,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {31853#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31853#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:36,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {31853#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31853#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:36,358 INFO L290 TraceCheckUtils]: 71: Hoare triple {31853#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31863#(<= 16 main_~j~0)} is VALID [2022-04-08 09:00:36,358 INFO L290 TraceCheckUtils]: 72: Hoare triple {31863#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31863#(<= 16 main_~j~0)} is VALID [2022-04-08 09:00:36,358 INFO L290 TraceCheckUtils]: 73: Hoare triple {31863#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31863#(<= 16 main_~j~0)} is VALID [2022-04-08 09:00:36,358 INFO L290 TraceCheckUtils]: 74: Hoare triple {31863#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31873#(<= 17 main_~j~0)} is VALID [2022-04-08 09:00:36,359 INFO L290 TraceCheckUtils]: 75: Hoare triple {31873#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31873#(<= 17 main_~j~0)} is VALID [2022-04-08 09:00:36,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {31873#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31873#(<= 17 main_~j~0)} is VALID [2022-04-08 09:00:36,359 INFO L290 TraceCheckUtils]: 77: Hoare triple {31873#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31883#(<= 18 main_~j~0)} is VALID [2022-04-08 09:00:36,359 INFO L290 TraceCheckUtils]: 78: Hoare triple {31883#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31883#(<= 18 main_~j~0)} is VALID [2022-04-08 09:00:36,360 INFO L290 TraceCheckUtils]: 79: Hoare triple {31883#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31883#(<= 18 main_~j~0)} is VALID [2022-04-08 09:00:36,360 INFO L290 TraceCheckUtils]: 80: Hoare triple {31883#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31893#(<= 19 main_~j~0)} is VALID [2022-04-08 09:00:36,361 INFO L290 TraceCheckUtils]: 81: Hoare triple {31893#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,361 INFO L290 TraceCheckUtils]: 82: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,361 INFO L290 TraceCheckUtils]: 83: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,361 INFO L290 TraceCheckUtils]: 84: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,362 INFO L290 TraceCheckUtils]: 85: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,362 INFO L290 TraceCheckUtils]: 86: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,362 INFO L290 TraceCheckUtils]: 87: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,362 INFO L290 TraceCheckUtils]: 88: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,363 INFO L290 TraceCheckUtils]: 89: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,363 INFO L290 TraceCheckUtils]: 90: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,363 INFO L290 TraceCheckUtils]: 91: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,363 INFO L290 TraceCheckUtils]: 92: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,364 INFO L290 TraceCheckUtils]: 93: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,364 INFO L290 TraceCheckUtils]: 94: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,364 INFO L290 TraceCheckUtils]: 95: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,364 INFO L290 TraceCheckUtils]: 96: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,365 INFO L290 TraceCheckUtils]: 97: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,365 INFO L290 TraceCheckUtils]: 98: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,365 INFO L290 TraceCheckUtils]: 99: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,365 INFO L290 TraceCheckUtils]: 100: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,366 INFO L290 TraceCheckUtils]: 101: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,366 INFO L290 TraceCheckUtils]: 102: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,366 INFO L290 TraceCheckUtils]: 103: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,366 INFO L290 TraceCheckUtils]: 104: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,367 INFO L290 TraceCheckUtils]: 105: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,368 INFO L290 TraceCheckUtils]: 106: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,369 INFO L290 TraceCheckUtils]: 107: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,369 INFO L290 TraceCheckUtils]: 108: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,369 INFO L290 TraceCheckUtils]: 109: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,369 INFO L290 TraceCheckUtils]: 110: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,370 INFO L290 TraceCheckUtils]: 111: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,370 INFO L290 TraceCheckUtils]: 112: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,370 INFO L290 TraceCheckUtils]: 113: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,370 INFO L290 TraceCheckUtils]: 114: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,371 INFO L290 TraceCheckUtils]: 115: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,371 INFO L290 TraceCheckUtils]: 116: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,371 INFO L290 TraceCheckUtils]: 117: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,371 INFO L290 TraceCheckUtils]: 118: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,372 INFO L290 TraceCheckUtils]: 119: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,372 INFO L290 TraceCheckUtils]: 120: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,372 INFO L290 TraceCheckUtils]: 121: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,372 INFO L290 TraceCheckUtils]: 122: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,373 INFO L290 TraceCheckUtils]: 123: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,373 INFO L290 TraceCheckUtils]: 124: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,373 INFO L290 TraceCheckUtils]: 125: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,373 INFO L290 TraceCheckUtils]: 126: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,374 INFO L290 TraceCheckUtils]: 127: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,374 INFO L290 TraceCheckUtils]: 128: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,374 INFO L290 TraceCheckUtils]: 129: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,374 INFO L290 TraceCheckUtils]: 130: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,374 INFO L290 TraceCheckUtils]: 131: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,375 INFO L290 TraceCheckUtils]: 132: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,375 INFO L290 TraceCheckUtils]: 133: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,375 INFO L290 TraceCheckUtils]: 134: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,375 INFO L290 TraceCheckUtils]: 135: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,376 INFO L290 TraceCheckUtils]: 136: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,376 INFO L290 TraceCheckUtils]: 137: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,376 INFO L290 TraceCheckUtils]: 138: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,376 INFO L290 TraceCheckUtils]: 139: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,377 INFO L290 TraceCheckUtils]: 140: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,377 INFO L290 TraceCheckUtils]: 141: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,377 INFO L290 TraceCheckUtils]: 142: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,377 INFO L290 TraceCheckUtils]: 143: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,378 INFO L290 TraceCheckUtils]: 144: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,378 INFO L290 TraceCheckUtils]: 145: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,378 INFO L290 TraceCheckUtils]: 146: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,378 INFO L290 TraceCheckUtils]: 147: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,379 INFO L290 TraceCheckUtils]: 148: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,379 INFO L290 TraceCheckUtils]: 149: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,379 INFO L290 TraceCheckUtils]: 150: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,379 INFO L290 TraceCheckUtils]: 151: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,379 INFO L290 TraceCheckUtils]: 152: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,380 INFO L290 TraceCheckUtils]: 153: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,380 INFO L290 TraceCheckUtils]: 154: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,380 INFO L290 TraceCheckUtils]: 155: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,380 INFO L290 TraceCheckUtils]: 156: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,381 INFO L290 TraceCheckUtils]: 157: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,381 INFO L290 TraceCheckUtils]: 158: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,381 INFO L290 TraceCheckUtils]: 159: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,381 INFO L290 TraceCheckUtils]: 160: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,382 INFO L290 TraceCheckUtils]: 161: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,382 INFO L290 TraceCheckUtils]: 162: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,382 INFO L290 TraceCheckUtils]: 163: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,383 INFO L290 TraceCheckUtils]: 164: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,383 INFO L290 TraceCheckUtils]: 165: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,383 INFO L290 TraceCheckUtils]: 166: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,384 INFO L290 TraceCheckUtils]: 167: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,384 INFO L290 TraceCheckUtils]: 168: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,384 INFO L290 TraceCheckUtils]: 169: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,384 INFO L290 TraceCheckUtils]: 170: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,384 INFO L290 TraceCheckUtils]: 171: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,385 INFO L290 TraceCheckUtils]: 172: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,385 INFO L290 TraceCheckUtils]: 173: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,385 INFO L290 TraceCheckUtils]: 174: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,385 INFO L290 TraceCheckUtils]: 175: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,386 INFO L290 TraceCheckUtils]: 176: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,386 INFO L290 TraceCheckUtils]: 177: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,386 INFO L290 TraceCheckUtils]: 178: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,386 INFO L290 TraceCheckUtils]: 179: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,387 INFO L290 TraceCheckUtils]: 180: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,387 INFO L290 TraceCheckUtils]: 181: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,387 INFO L290 TraceCheckUtils]: 182: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,387 INFO L290 TraceCheckUtils]: 183: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,388 INFO L290 TraceCheckUtils]: 184: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,388 INFO L290 TraceCheckUtils]: 185: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,388 INFO L290 TraceCheckUtils]: 186: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,388 INFO L290 TraceCheckUtils]: 187: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,388 INFO L290 TraceCheckUtils]: 188: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,389 INFO L290 TraceCheckUtils]: 189: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,389 INFO L290 TraceCheckUtils]: 190: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,389 INFO L290 TraceCheckUtils]: 191: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,389 INFO L290 TraceCheckUtils]: 192: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,390 INFO L290 TraceCheckUtils]: 193: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,390 INFO L290 TraceCheckUtils]: 194: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,390 INFO L290 TraceCheckUtils]: 195: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,390 INFO L290 TraceCheckUtils]: 196: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,391 INFO L290 TraceCheckUtils]: 197: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,391 INFO L290 TraceCheckUtils]: 198: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,391 INFO L290 TraceCheckUtils]: 199: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,391 INFO L290 TraceCheckUtils]: 200: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,392 INFO L290 TraceCheckUtils]: 201: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,392 INFO L290 TraceCheckUtils]: 202: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,392 INFO L290 TraceCheckUtils]: 203: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,393 INFO L290 TraceCheckUtils]: 204: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,393 INFO L290 TraceCheckUtils]: 205: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,393 INFO L290 TraceCheckUtils]: 206: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,393 INFO L290 TraceCheckUtils]: 207: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,394 INFO L290 TraceCheckUtils]: 208: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,394 INFO L290 TraceCheckUtils]: 209: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,394 INFO L290 TraceCheckUtils]: 210: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,394 INFO L290 TraceCheckUtils]: 211: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,395 INFO L290 TraceCheckUtils]: 212: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,395 INFO L290 TraceCheckUtils]: 213: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,395 INFO L290 TraceCheckUtils]: 214: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,395 INFO L290 TraceCheckUtils]: 215: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,395 INFO L290 TraceCheckUtils]: 216: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,396 INFO L290 TraceCheckUtils]: 217: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,396 INFO L290 TraceCheckUtils]: 218: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,396 INFO L290 TraceCheckUtils]: 219: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,396 INFO L290 TraceCheckUtils]: 220: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,397 INFO L290 TraceCheckUtils]: 221: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,397 INFO L290 TraceCheckUtils]: 222: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,397 INFO L290 TraceCheckUtils]: 223: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,397 INFO L290 TraceCheckUtils]: 224: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,398 INFO L290 TraceCheckUtils]: 225: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,398 INFO L290 TraceCheckUtils]: 226: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,398 INFO L290 TraceCheckUtils]: 227: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,398 INFO L290 TraceCheckUtils]: 228: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,399 INFO L290 TraceCheckUtils]: 229: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,399 INFO L290 TraceCheckUtils]: 230: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,399 INFO L290 TraceCheckUtils]: 231: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,399 INFO L290 TraceCheckUtils]: 232: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,399 INFO L290 TraceCheckUtils]: 233: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,400 INFO L290 TraceCheckUtils]: 234: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,400 INFO L290 TraceCheckUtils]: 235: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,400 INFO L290 TraceCheckUtils]: 236: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,400 INFO L290 TraceCheckUtils]: 237: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,401 INFO L290 TraceCheckUtils]: 238: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,401 INFO L290 TraceCheckUtils]: 239: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,401 INFO L290 TraceCheckUtils]: 240: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,401 INFO L290 TraceCheckUtils]: 241: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,402 INFO L290 TraceCheckUtils]: 242: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,402 INFO L290 TraceCheckUtils]: 243: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,402 INFO L290 TraceCheckUtils]: 244: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,402 INFO L290 TraceCheckUtils]: 245: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,403 INFO L290 TraceCheckUtils]: 246: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,403 INFO L290 TraceCheckUtils]: 247: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,403 INFO L290 TraceCheckUtils]: 248: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,403 INFO L290 TraceCheckUtils]: 249: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,403 INFO L290 TraceCheckUtils]: 250: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,404 INFO L290 TraceCheckUtils]: 251: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,404 INFO L290 TraceCheckUtils]: 252: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,404 INFO L290 TraceCheckUtils]: 253: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,404 INFO L290 TraceCheckUtils]: 254: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,405 INFO L290 TraceCheckUtils]: 255: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,405 INFO L290 TraceCheckUtils]: 256: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,405 INFO L290 TraceCheckUtils]: 257: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,405 INFO L290 TraceCheckUtils]: 258: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,406 INFO L290 TraceCheckUtils]: 259: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,406 INFO L290 TraceCheckUtils]: 260: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,407 INFO L290 TraceCheckUtils]: 261: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,407 INFO L290 TraceCheckUtils]: 262: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,407 INFO L290 TraceCheckUtils]: 263: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,408 INFO L290 TraceCheckUtils]: 264: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,408 INFO L290 TraceCheckUtils]: 265: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,408 INFO L290 TraceCheckUtils]: 266: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,408 INFO L290 TraceCheckUtils]: 267: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,408 INFO L290 TraceCheckUtils]: 268: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,409 INFO L290 TraceCheckUtils]: 269: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,409 INFO L290 TraceCheckUtils]: 270: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,409 INFO L290 TraceCheckUtils]: 271: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,409 INFO L290 TraceCheckUtils]: 272: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,410 INFO L290 TraceCheckUtils]: 273: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,410 INFO L290 TraceCheckUtils]: 274: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,410 INFO L290 TraceCheckUtils]: 275: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:36,410 INFO L290 TraceCheckUtils]: 276: Hoare triple {31897#(< 19 main_~edgecount~0)} ~i~0 := 0; {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:00:36,411 INFO L290 TraceCheckUtils]: 277: Hoare triple {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:00:36,411 INFO L290 TraceCheckUtils]: 278: Hoare triple {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:00:36,412 INFO L290 TraceCheckUtils]: 279: Hoare triple {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32493#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:00:36,412 INFO L290 TraceCheckUtils]: 280: Hoare triple {32493#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-08 09:00:36,412 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-08 09:00:36,412 INFO L290 TraceCheckUtils]: 282: Hoare triple {31620#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-08 09:00:36,412 INFO L272 TraceCheckUtils]: 283: Hoare triple {31620#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {31620#false} is VALID [2022-04-08 09:00:36,412 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-08 09:00:36,412 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-08 09:00:36,412 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-08 09:00:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 536 proven. 3599 refuted. 0 times theorem prover too weak. 5723 trivial. 0 not checked. [2022-04-08 09:00:36,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:37,612 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-08 09:00:37,612 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-08 09:00:37,612 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-08 09:00:37,612 INFO L272 TraceCheckUtils]: 283: Hoare triple {31620#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {31620#false} is VALID [2022-04-08 09:00:37,612 INFO L290 TraceCheckUtils]: 282: Hoare triple {31620#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-08 09:00:37,612 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-08 09:00:37,612 INFO L290 TraceCheckUtils]: 280: Hoare triple {32533#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-08 09:00:37,613 INFO L290 TraceCheckUtils]: 279: Hoare triple {32537#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32533#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,613 INFO L290 TraceCheckUtils]: 278: Hoare triple {32537#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32537#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:37,613 INFO L290 TraceCheckUtils]: 277: Hoare triple {32537#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32537#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:37,613 INFO L290 TraceCheckUtils]: 276: Hoare triple {32547#(< 1 main_~edgecount~0)} ~i~0 := 0; {32537#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:37,614 INFO L290 TraceCheckUtils]: 275: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,614 INFO L290 TraceCheckUtils]: 274: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,614 INFO L290 TraceCheckUtils]: 273: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,614 INFO L290 TraceCheckUtils]: 272: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,615 INFO L290 TraceCheckUtils]: 271: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,615 INFO L290 TraceCheckUtils]: 270: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,615 INFO L290 TraceCheckUtils]: 269: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,615 INFO L290 TraceCheckUtils]: 268: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,616 INFO L290 TraceCheckUtils]: 267: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,616 INFO L290 TraceCheckUtils]: 266: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,616 INFO L290 TraceCheckUtils]: 265: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,616 INFO L290 TraceCheckUtils]: 264: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,616 INFO L290 TraceCheckUtils]: 263: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,617 INFO L290 TraceCheckUtils]: 262: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,617 INFO L290 TraceCheckUtils]: 261: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,617 INFO L290 TraceCheckUtils]: 260: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,617 INFO L290 TraceCheckUtils]: 259: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,618 INFO L290 TraceCheckUtils]: 258: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,618 INFO L290 TraceCheckUtils]: 257: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,618 INFO L290 TraceCheckUtils]: 256: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,618 INFO L290 TraceCheckUtils]: 255: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,619 INFO L290 TraceCheckUtils]: 254: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,619 INFO L290 TraceCheckUtils]: 253: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,619 INFO L290 TraceCheckUtils]: 252: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,619 INFO L290 TraceCheckUtils]: 251: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,620 INFO L290 TraceCheckUtils]: 250: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,620 INFO L290 TraceCheckUtils]: 249: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,620 INFO L290 TraceCheckUtils]: 248: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,620 INFO L290 TraceCheckUtils]: 247: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,620 INFO L290 TraceCheckUtils]: 246: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,621 INFO L290 TraceCheckUtils]: 245: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,621 INFO L290 TraceCheckUtils]: 244: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,621 INFO L290 TraceCheckUtils]: 243: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,621 INFO L290 TraceCheckUtils]: 242: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,622 INFO L290 TraceCheckUtils]: 241: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,622 INFO L290 TraceCheckUtils]: 240: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,622 INFO L290 TraceCheckUtils]: 239: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,622 INFO L290 TraceCheckUtils]: 238: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,623 INFO L290 TraceCheckUtils]: 237: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,623 INFO L290 TraceCheckUtils]: 236: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,623 INFO L290 TraceCheckUtils]: 235: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,623 INFO L290 TraceCheckUtils]: 234: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,624 INFO L290 TraceCheckUtils]: 233: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,624 INFO L290 TraceCheckUtils]: 232: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,624 INFO L290 TraceCheckUtils]: 231: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,624 INFO L290 TraceCheckUtils]: 230: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,624 INFO L290 TraceCheckUtils]: 229: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,625 INFO L290 TraceCheckUtils]: 228: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,625 INFO L290 TraceCheckUtils]: 227: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,625 INFO L290 TraceCheckUtils]: 226: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,625 INFO L290 TraceCheckUtils]: 225: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,626 INFO L290 TraceCheckUtils]: 224: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,626 INFO L290 TraceCheckUtils]: 223: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,626 INFO L290 TraceCheckUtils]: 222: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,626 INFO L290 TraceCheckUtils]: 221: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,627 INFO L290 TraceCheckUtils]: 220: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,627 INFO L290 TraceCheckUtils]: 219: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,627 INFO L290 TraceCheckUtils]: 218: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,627 INFO L290 TraceCheckUtils]: 217: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,628 INFO L290 TraceCheckUtils]: 216: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,628 INFO L290 TraceCheckUtils]: 215: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,628 INFO L290 TraceCheckUtils]: 214: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,628 INFO L290 TraceCheckUtils]: 213: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,629 INFO L290 TraceCheckUtils]: 212: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,629 INFO L290 TraceCheckUtils]: 211: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,629 INFO L290 TraceCheckUtils]: 210: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,629 INFO L290 TraceCheckUtils]: 209: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,629 INFO L290 TraceCheckUtils]: 208: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,630 INFO L290 TraceCheckUtils]: 207: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,630 INFO L290 TraceCheckUtils]: 206: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,630 INFO L290 TraceCheckUtils]: 205: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,630 INFO L290 TraceCheckUtils]: 204: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,631 INFO L290 TraceCheckUtils]: 203: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,631 INFO L290 TraceCheckUtils]: 202: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,631 INFO L290 TraceCheckUtils]: 201: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,631 INFO L290 TraceCheckUtils]: 200: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,632 INFO L290 TraceCheckUtils]: 199: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,632 INFO L290 TraceCheckUtils]: 198: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,632 INFO L290 TraceCheckUtils]: 197: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,632 INFO L290 TraceCheckUtils]: 196: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,632 INFO L290 TraceCheckUtils]: 195: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,633 INFO L290 TraceCheckUtils]: 194: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,633 INFO L290 TraceCheckUtils]: 193: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,633 INFO L290 TraceCheckUtils]: 192: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,633 INFO L290 TraceCheckUtils]: 191: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,634 INFO L290 TraceCheckUtils]: 190: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,634 INFO L290 TraceCheckUtils]: 189: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,634 INFO L290 TraceCheckUtils]: 188: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,634 INFO L290 TraceCheckUtils]: 187: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,635 INFO L290 TraceCheckUtils]: 186: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,635 INFO L290 TraceCheckUtils]: 185: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,635 INFO L290 TraceCheckUtils]: 184: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,635 INFO L290 TraceCheckUtils]: 183: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,636 INFO L290 TraceCheckUtils]: 182: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,636 INFO L290 TraceCheckUtils]: 181: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,636 INFO L290 TraceCheckUtils]: 180: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,636 INFO L290 TraceCheckUtils]: 179: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,636 INFO L290 TraceCheckUtils]: 178: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,637 INFO L290 TraceCheckUtils]: 177: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,637 INFO L290 TraceCheckUtils]: 176: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,637 INFO L290 TraceCheckUtils]: 175: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,637 INFO L290 TraceCheckUtils]: 174: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,638 INFO L290 TraceCheckUtils]: 173: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,638 INFO L290 TraceCheckUtils]: 172: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,638 INFO L290 TraceCheckUtils]: 171: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,638 INFO L290 TraceCheckUtils]: 170: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,639 INFO L290 TraceCheckUtils]: 169: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,639 INFO L290 TraceCheckUtils]: 168: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,639 INFO L290 TraceCheckUtils]: 167: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,639 INFO L290 TraceCheckUtils]: 166: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,640 INFO L290 TraceCheckUtils]: 165: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,640 INFO L290 TraceCheckUtils]: 164: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,640 INFO L290 TraceCheckUtils]: 163: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,640 INFO L290 TraceCheckUtils]: 162: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,640 INFO L290 TraceCheckUtils]: 161: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,641 INFO L290 TraceCheckUtils]: 160: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,641 INFO L290 TraceCheckUtils]: 159: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,641 INFO L290 TraceCheckUtils]: 158: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,641 INFO L290 TraceCheckUtils]: 157: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,642 INFO L290 TraceCheckUtils]: 156: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,642 INFO L290 TraceCheckUtils]: 155: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,642 INFO L290 TraceCheckUtils]: 154: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,642 INFO L290 TraceCheckUtils]: 153: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,643 INFO L290 TraceCheckUtils]: 152: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,643 INFO L290 TraceCheckUtils]: 151: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,643 INFO L290 TraceCheckUtils]: 150: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,643 INFO L290 TraceCheckUtils]: 149: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,643 INFO L290 TraceCheckUtils]: 148: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,644 INFO L290 TraceCheckUtils]: 147: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,644 INFO L290 TraceCheckUtils]: 146: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,644 INFO L290 TraceCheckUtils]: 145: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,644 INFO L290 TraceCheckUtils]: 144: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,645 INFO L290 TraceCheckUtils]: 143: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,645 INFO L290 TraceCheckUtils]: 142: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,645 INFO L290 TraceCheckUtils]: 141: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,645 INFO L290 TraceCheckUtils]: 140: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,646 INFO L290 TraceCheckUtils]: 139: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,646 INFO L290 TraceCheckUtils]: 138: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,646 INFO L290 TraceCheckUtils]: 137: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,646 INFO L290 TraceCheckUtils]: 136: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,646 INFO L290 TraceCheckUtils]: 135: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,647 INFO L290 TraceCheckUtils]: 134: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,647 INFO L290 TraceCheckUtils]: 133: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,647 INFO L290 TraceCheckUtils]: 132: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,647 INFO L290 TraceCheckUtils]: 131: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,648 INFO L290 TraceCheckUtils]: 130: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,648 INFO L290 TraceCheckUtils]: 129: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,648 INFO L290 TraceCheckUtils]: 128: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,648 INFO L290 TraceCheckUtils]: 127: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,649 INFO L290 TraceCheckUtils]: 126: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,649 INFO L290 TraceCheckUtils]: 125: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,649 INFO L290 TraceCheckUtils]: 124: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,649 INFO L290 TraceCheckUtils]: 123: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,650 INFO L290 TraceCheckUtils]: 122: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,650 INFO L290 TraceCheckUtils]: 121: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,650 INFO L290 TraceCheckUtils]: 120: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,650 INFO L290 TraceCheckUtils]: 119: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,651 INFO L290 TraceCheckUtils]: 118: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,651 INFO L290 TraceCheckUtils]: 117: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,651 INFO L290 TraceCheckUtils]: 116: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,651 INFO L290 TraceCheckUtils]: 115: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,651 INFO L290 TraceCheckUtils]: 114: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,652 INFO L290 TraceCheckUtils]: 113: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,652 INFO L290 TraceCheckUtils]: 112: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,652 INFO L290 TraceCheckUtils]: 111: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,652 INFO L290 TraceCheckUtils]: 110: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,653 INFO L290 TraceCheckUtils]: 109: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,653 INFO L290 TraceCheckUtils]: 108: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,653 INFO L290 TraceCheckUtils]: 107: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,653 INFO L290 TraceCheckUtils]: 106: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,654 INFO L290 TraceCheckUtils]: 105: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,654 INFO L290 TraceCheckUtils]: 104: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,654 INFO L290 TraceCheckUtils]: 103: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,654 INFO L290 TraceCheckUtils]: 102: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,654 INFO L290 TraceCheckUtils]: 101: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,655 INFO L290 TraceCheckUtils]: 100: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,655 INFO L290 TraceCheckUtils]: 99: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,655 INFO L290 TraceCheckUtils]: 98: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,655 INFO L290 TraceCheckUtils]: 97: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,656 INFO L290 TraceCheckUtils]: 96: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,656 INFO L290 TraceCheckUtils]: 95: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,656 INFO L290 TraceCheckUtils]: 94: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,656 INFO L290 TraceCheckUtils]: 93: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,657 INFO L290 TraceCheckUtils]: 92: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,657 INFO L290 TraceCheckUtils]: 91: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,657 INFO L290 TraceCheckUtils]: 90: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,657 INFO L290 TraceCheckUtils]: 89: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,657 INFO L290 TraceCheckUtils]: 88: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,658 INFO L290 TraceCheckUtils]: 87: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,658 INFO L290 TraceCheckUtils]: 86: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,658 INFO L290 TraceCheckUtils]: 85: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,658 INFO L290 TraceCheckUtils]: 84: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,659 INFO L290 TraceCheckUtils]: 83: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,659 INFO L290 TraceCheckUtils]: 82: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,660 INFO L290 TraceCheckUtils]: 81: Hoare triple {31713#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:37,660 INFO L290 TraceCheckUtils]: 80: Hoare triple {31703#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31713#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:37,660 INFO L290 TraceCheckUtils]: 79: Hoare triple {31703#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:37,661 INFO L290 TraceCheckUtils]: 78: Hoare triple {31703#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:37,661 INFO L290 TraceCheckUtils]: 77: Hoare triple {33145#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:37,661 INFO L290 TraceCheckUtils]: 76: Hoare triple {33145#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33145#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:37,661 INFO L290 TraceCheckUtils]: 75: Hoare triple {33145#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33145#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:37,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {33155#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33145#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:00:37,662 INFO L290 TraceCheckUtils]: 73: Hoare triple {33155#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33155#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:37,663 INFO L290 TraceCheckUtils]: 72: Hoare triple {33155#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33155#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:37,663 INFO L290 TraceCheckUtils]: 71: Hoare triple {33165#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33155#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:00:37,663 INFO L290 TraceCheckUtils]: 70: Hoare triple {33165#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33165#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:37,664 INFO L290 TraceCheckUtils]: 69: Hoare triple {33165#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33165#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:37,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {33175#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33165#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:00:37,664 INFO L290 TraceCheckUtils]: 67: Hoare triple {33175#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33175#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:37,664 INFO L290 TraceCheckUtils]: 66: Hoare triple {33175#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33175#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:37,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {33185#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33175#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:00:37,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {33185#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33185#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:37,665 INFO L290 TraceCheckUtils]: 63: Hoare triple {33185#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33185#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:37,666 INFO L290 TraceCheckUtils]: 62: Hoare triple {33195#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33185#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:00:37,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {33195#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33195#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:37,666 INFO L290 TraceCheckUtils]: 60: Hoare triple {33195#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33195#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:37,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {33205#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33195#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:00:37,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {33205#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33205#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:37,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {33205#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33205#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:37,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {33215#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33205#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:00:37,668 INFO L290 TraceCheckUtils]: 55: Hoare triple {33215#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33215#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:37,668 INFO L290 TraceCheckUtils]: 54: Hoare triple {33215#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33215#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:37,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {33225#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33215#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:00:37,669 INFO L290 TraceCheckUtils]: 52: Hoare triple {33225#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33225#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:37,669 INFO L290 TraceCheckUtils]: 51: Hoare triple {33225#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33225#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:37,669 INFO L290 TraceCheckUtils]: 50: Hoare triple {33235#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33225#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:00:37,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {33235#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33235#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:37,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {33235#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33235#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:37,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {33245#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33235#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:00:37,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {33245#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33245#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:37,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {33245#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33245#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:37,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {33255#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33245#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:00:37,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {33255#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33255#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:37,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {33255#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33255#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:37,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {33265#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33255#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:00:37,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {33265#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33265#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:00:37,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {33265#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33265#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:00:37,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {33275#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33265#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:00:37,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {33275#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33275#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:00:37,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {33275#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33275#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:00:37,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {33285#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33275#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:00:37,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {33285#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33285#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:00:37,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {33285#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33285#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:00:37,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {33295#(<= 0 (+ main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33285#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:00:37,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {33295#(<= 0 (+ main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33295#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 09:00:37,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {33295#(<= 0 (+ main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33295#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 09:00:37,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {33305#(<= 0 (+ main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33295#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 09:00:37,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {33305#(<= 0 (+ main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33305#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 09:00:37,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {33305#(<= 0 (+ main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33305#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 09:00:37,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {33315#(<= 0 (+ main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33305#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 09:00:37,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {33315#(<= 0 (+ main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33315#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 09:00:37,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {33315#(<= 0 (+ main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33315#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {33315#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {31619#true} ~i~0 := 0; {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {31619#true} assume !(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {31619#true} is VALID [2022-04-08 09:00:37,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-08 09:00:37,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-08 09:00:37,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-08 09:00:37,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-08 09:00:37,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-08 09:00:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 536 proven. 3599 refuted. 0 times theorem prover too weak. 5723 trivial. 0 not checked. [2022-04-08 09:00:37,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936982215] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:37,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:37,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25, 25] total 53 [2022-04-08 09:00:37,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:37,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [112529782] [2022-04-08 09:00:37,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [112529782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:37,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:37,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:00:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554933474] [2022-04-08 09:00:37,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:37,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 287 [2022-04-08 09:00:37,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:37,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:37,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:37,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:00:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:37,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:00:37,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 09:00:37,712 INFO L87 Difference]: Start difference. First operand 292 states and 380 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:39,515 INFO L93 Difference]: Finished difference Result 406 states and 525 transitions. [2022-04-08 09:00:39,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:00:39,516 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 287 [2022-04-08 09:00:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-04-08 09:00:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-04-08 09:00:39,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 139 transitions. [2022-04-08 09:00:39,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:39,633 INFO L225 Difference]: With dead ends: 406 [2022-04-08 09:00:39,633 INFO L226 Difference]: Without dead ends: 390 [2022-04-08 09:00:39,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=886, Invalid=2536, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 09:00:39,634 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 206 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:39,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 39 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-08 09:00:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 355. [2022-04-08 09:00:41,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:41,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:41,087 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:41,087 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:41,093 INFO L93 Difference]: Finished difference Result 390 states and 507 transitions. [2022-04-08 09:00:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 507 transitions. [2022-04-08 09:00:41,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:41,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:41,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 390 states. [2022-04-08 09:00:41,095 INFO L87 Difference]: Start difference. First operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 390 states. [2022-04-08 09:00:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:41,101 INFO L93 Difference]: Finished difference Result 390 states and 507 transitions. [2022-04-08 09:00:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 507 transitions. [2022-04-08 09:00:41,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:41,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:41,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:41,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 464 transitions. [2022-04-08 09:00:41,107 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 464 transitions. Word has length 287 [2022-04-08 09:00:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:41,107 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 464 transitions. [2022-04-08 09:00:41,107 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:41,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 464 transitions. [2022-04-08 09:00:41,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 464 transitions. [2022-04-08 09:00:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2022-04-08 09:00:41,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:41,908 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:41,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:42,124 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:42,124 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:42,125 INFO L85 PathProgramCache]: Analyzing trace with hash 587258522, now seen corresponding path program 53 times [2022-04-08 09:00:42,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:42,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1814581220] [2022-04-08 09:00:42,134 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:42,134 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash 587258522, now seen corresponding path program 54 times [2022-04-08 09:00:42,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:42,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397587322] [2022-04-08 09:00:42,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:42,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:42,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {35718#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-08 09:00:42,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-08 09:00:42,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-08 09:00:42,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35718#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:42,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {35718#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-08 09:00:42,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-08 09:00:42,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-08 09:00:42,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-08 09:00:42,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {35710#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,447 INFO L290 TraceCheckUtils]: 54: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,449 INFO L290 TraceCheckUtils]: 63: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,449 INFO L290 TraceCheckUtils]: 64: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,449 INFO L290 TraceCheckUtils]: 67: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,450 INFO L290 TraceCheckUtils]: 68: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,450 INFO L290 TraceCheckUtils]: 69: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,450 INFO L290 TraceCheckUtils]: 71: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,451 INFO L290 TraceCheckUtils]: 72: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,451 INFO L290 TraceCheckUtils]: 73: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,451 INFO L290 TraceCheckUtils]: 74: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,451 INFO L290 TraceCheckUtils]: 75: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,451 INFO L290 TraceCheckUtils]: 76: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,452 INFO L290 TraceCheckUtils]: 77: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,452 INFO L290 TraceCheckUtils]: 78: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,452 INFO L290 TraceCheckUtils]: 79: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,452 INFO L290 TraceCheckUtils]: 80: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,453 INFO L290 TraceCheckUtils]: 81: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,453 INFO L290 TraceCheckUtils]: 82: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,453 INFO L290 TraceCheckUtils]: 83: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,453 INFO L290 TraceCheckUtils]: 84: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,453 INFO L290 TraceCheckUtils]: 85: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,454 INFO L290 TraceCheckUtils]: 86: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,454 INFO L290 TraceCheckUtils]: 87: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,454 INFO L290 TraceCheckUtils]: 88: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,454 INFO L290 TraceCheckUtils]: 89: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,455 INFO L290 TraceCheckUtils]: 90: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,455 INFO L290 TraceCheckUtils]: 91: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,455 INFO L290 TraceCheckUtils]: 92: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,455 INFO L290 TraceCheckUtils]: 93: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,455 INFO L290 TraceCheckUtils]: 94: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,456 INFO L290 TraceCheckUtils]: 95: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,456 INFO L290 TraceCheckUtils]: 96: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,456 INFO L290 TraceCheckUtils]: 97: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,456 INFO L290 TraceCheckUtils]: 98: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,457 INFO L290 TraceCheckUtils]: 99: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,457 INFO L290 TraceCheckUtils]: 100: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,457 INFO L290 TraceCheckUtils]: 101: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,457 INFO L290 TraceCheckUtils]: 102: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,457 INFO L290 TraceCheckUtils]: 103: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,458 INFO L290 TraceCheckUtils]: 104: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,458 INFO L290 TraceCheckUtils]: 105: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,458 INFO L290 TraceCheckUtils]: 106: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,458 INFO L290 TraceCheckUtils]: 107: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,458 INFO L290 TraceCheckUtils]: 108: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,459 INFO L290 TraceCheckUtils]: 109: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,459 INFO L290 TraceCheckUtils]: 110: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,459 INFO L290 TraceCheckUtils]: 111: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,459 INFO L290 TraceCheckUtils]: 112: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,460 INFO L290 TraceCheckUtils]: 113: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,460 INFO L290 TraceCheckUtils]: 114: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,460 INFO L290 TraceCheckUtils]: 115: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,460 INFO L290 TraceCheckUtils]: 116: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,460 INFO L290 TraceCheckUtils]: 117: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,461 INFO L290 TraceCheckUtils]: 118: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,461 INFO L290 TraceCheckUtils]: 119: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,461 INFO L290 TraceCheckUtils]: 120: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,461 INFO L290 TraceCheckUtils]: 121: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,462 INFO L290 TraceCheckUtils]: 122: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,462 INFO L290 TraceCheckUtils]: 123: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,462 INFO L290 TraceCheckUtils]: 124: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,462 INFO L290 TraceCheckUtils]: 125: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,462 INFO L290 TraceCheckUtils]: 126: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,463 INFO L290 TraceCheckUtils]: 127: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,463 INFO L290 TraceCheckUtils]: 128: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,463 INFO L290 TraceCheckUtils]: 129: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,463 INFO L290 TraceCheckUtils]: 130: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,464 INFO L290 TraceCheckUtils]: 131: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,464 INFO L290 TraceCheckUtils]: 132: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,464 INFO L290 TraceCheckUtils]: 133: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,464 INFO L290 TraceCheckUtils]: 134: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,464 INFO L290 TraceCheckUtils]: 135: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,465 INFO L290 TraceCheckUtils]: 136: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,465 INFO L290 TraceCheckUtils]: 137: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,465 INFO L290 TraceCheckUtils]: 138: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,465 INFO L290 TraceCheckUtils]: 139: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,465 INFO L290 TraceCheckUtils]: 140: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,466 INFO L290 TraceCheckUtils]: 141: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,466 INFO L290 TraceCheckUtils]: 142: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,466 INFO L290 TraceCheckUtils]: 143: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,466 INFO L290 TraceCheckUtils]: 144: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,467 INFO L290 TraceCheckUtils]: 145: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,467 INFO L290 TraceCheckUtils]: 146: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,467 INFO L290 TraceCheckUtils]: 147: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,467 INFO L290 TraceCheckUtils]: 148: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,467 INFO L290 TraceCheckUtils]: 149: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,468 INFO L290 TraceCheckUtils]: 150: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,468 INFO L290 TraceCheckUtils]: 151: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,468 INFO L290 TraceCheckUtils]: 152: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,468 INFO L290 TraceCheckUtils]: 153: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,469 INFO L290 TraceCheckUtils]: 154: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,469 INFO L290 TraceCheckUtils]: 155: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,469 INFO L290 TraceCheckUtils]: 156: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,469 INFO L290 TraceCheckUtils]: 157: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,469 INFO L290 TraceCheckUtils]: 158: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,470 INFO L290 TraceCheckUtils]: 159: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,470 INFO L290 TraceCheckUtils]: 160: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,470 INFO L290 TraceCheckUtils]: 161: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,470 INFO L290 TraceCheckUtils]: 162: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,471 INFO L290 TraceCheckUtils]: 163: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,471 INFO L290 TraceCheckUtils]: 164: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,475 INFO L290 TraceCheckUtils]: 165: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,475 INFO L290 TraceCheckUtils]: 166: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,475 INFO L290 TraceCheckUtils]: 167: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,476 INFO L290 TraceCheckUtils]: 168: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,476 INFO L290 TraceCheckUtils]: 169: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,476 INFO L290 TraceCheckUtils]: 170: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,476 INFO L290 TraceCheckUtils]: 171: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,476 INFO L290 TraceCheckUtils]: 172: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,477 INFO L290 TraceCheckUtils]: 173: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,477 INFO L290 TraceCheckUtils]: 174: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,477 INFO L290 TraceCheckUtils]: 175: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,477 INFO L290 TraceCheckUtils]: 176: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,477 INFO L290 TraceCheckUtils]: 177: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,478 INFO L290 TraceCheckUtils]: 178: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,478 INFO L290 TraceCheckUtils]: 179: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,478 INFO L290 TraceCheckUtils]: 180: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,478 INFO L290 TraceCheckUtils]: 181: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,479 INFO L290 TraceCheckUtils]: 182: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,479 INFO L290 TraceCheckUtils]: 183: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,479 INFO L290 TraceCheckUtils]: 184: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,479 INFO L290 TraceCheckUtils]: 185: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,479 INFO L290 TraceCheckUtils]: 186: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,480 INFO L290 TraceCheckUtils]: 187: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,480 INFO L290 TraceCheckUtils]: 188: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,480 INFO L290 TraceCheckUtils]: 189: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,480 INFO L290 TraceCheckUtils]: 190: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,480 INFO L290 TraceCheckUtils]: 191: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,481 INFO L290 TraceCheckUtils]: 192: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,481 INFO L290 TraceCheckUtils]: 193: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,481 INFO L290 TraceCheckUtils]: 194: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,481 INFO L290 TraceCheckUtils]: 195: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,481 INFO L290 TraceCheckUtils]: 196: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,482 INFO L290 TraceCheckUtils]: 197: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,482 INFO L290 TraceCheckUtils]: 198: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,482 INFO L290 TraceCheckUtils]: 199: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,482 INFO L290 TraceCheckUtils]: 200: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,482 INFO L290 TraceCheckUtils]: 201: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,483 INFO L290 TraceCheckUtils]: 202: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,483 INFO L290 TraceCheckUtils]: 203: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,483 INFO L290 TraceCheckUtils]: 204: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,483 INFO L290 TraceCheckUtils]: 205: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,484 INFO L290 TraceCheckUtils]: 206: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,484 INFO L290 TraceCheckUtils]: 207: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,484 INFO L290 TraceCheckUtils]: 208: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,484 INFO L290 TraceCheckUtils]: 209: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,484 INFO L290 TraceCheckUtils]: 210: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,485 INFO L290 TraceCheckUtils]: 211: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,485 INFO L290 TraceCheckUtils]: 212: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,485 INFO L290 TraceCheckUtils]: 213: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,485 INFO L290 TraceCheckUtils]: 214: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,485 INFO L290 TraceCheckUtils]: 215: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,486 INFO L290 TraceCheckUtils]: 216: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,486 INFO L290 TraceCheckUtils]: 217: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,486 INFO L290 TraceCheckUtils]: 218: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,486 INFO L290 TraceCheckUtils]: 219: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,486 INFO L290 TraceCheckUtils]: 220: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,487 INFO L290 TraceCheckUtils]: 221: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,487 INFO L290 TraceCheckUtils]: 222: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,487 INFO L290 TraceCheckUtils]: 223: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,487 INFO L290 TraceCheckUtils]: 224: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,488 INFO L290 TraceCheckUtils]: 225: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,488 INFO L290 TraceCheckUtils]: 226: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,488 INFO L290 TraceCheckUtils]: 227: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,488 INFO L290 TraceCheckUtils]: 228: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,488 INFO L290 TraceCheckUtils]: 229: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,489 INFO L290 TraceCheckUtils]: 230: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,489 INFO L290 TraceCheckUtils]: 231: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,489 INFO L290 TraceCheckUtils]: 232: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,489 INFO L290 TraceCheckUtils]: 233: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,489 INFO L290 TraceCheckUtils]: 234: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,490 INFO L290 TraceCheckUtils]: 235: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,490 INFO L290 TraceCheckUtils]: 236: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,490 INFO L290 TraceCheckUtils]: 237: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,490 INFO L290 TraceCheckUtils]: 238: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,490 INFO L290 TraceCheckUtils]: 239: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,491 INFO L290 TraceCheckUtils]: 240: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,491 INFO L290 TraceCheckUtils]: 241: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,491 INFO L290 TraceCheckUtils]: 242: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,491 INFO L290 TraceCheckUtils]: 243: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,492 INFO L290 TraceCheckUtils]: 244: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,492 INFO L290 TraceCheckUtils]: 245: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,492 INFO L290 TraceCheckUtils]: 246: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,492 INFO L290 TraceCheckUtils]: 247: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,492 INFO L290 TraceCheckUtils]: 248: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,493 INFO L290 TraceCheckUtils]: 249: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,493 INFO L290 TraceCheckUtils]: 250: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,493 INFO L290 TraceCheckUtils]: 251: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,493 INFO L290 TraceCheckUtils]: 252: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,493 INFO L290 TraceCheckUtils]: 253: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,494 INFO L290 TraceCheckUtils]: 254: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,494 INFO L290 TraceCheckUtils]: 255: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,494 INFO L290 TraceCheckUtils]: 256: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,494 INFO L290 TraceCheckUtils]: 257: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,494 INFO L290 TraceCheckUtils]: 258: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,495 INFO L290 TraceCheckUtils]: 259: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,495 INFO L290 TraceCheckUtils]: 260: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,495 INFO L290 TraceCheckUtils]: 261: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,495 INFO L290 TraceCheckUtils]: 262: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,495 INFO L290 TraceCheckUtils]: 263: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,496 INFO L290 TraceCheckUtils]: 264: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,496 INFO L290 TraceCheckUtils]: 265: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,496 INFO L290 TraceCheckUtils]: 266: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,496 INFO L290 TraceCheckUtils]: 267: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,496 INFO L290 TraceCheckUtils]: 268: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,497 INFO L290 TraceCheckUtils]: 269: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,497 INFO L290 TraceCheckUtils]: 270: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,497 INFO L290 TraceCheckUtils]: 271: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,497 INFO L290 TraceCheckUtils]: 272: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,498 INFO L290 TraceCheckUtils]: 273: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,498 INFO L290 TraceCheckUtils]: 274: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,498 INFO L290 TraceCheckUtils]: 275: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,498 INFO L290 TraceCheckUtils]: 276: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,498 INFO L290 TraceCheckUtils]: 277: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,499 INFO L290 TraceCheckUtils]: 278: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,499 INFO L290 TraceCheckUtils]: 279: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,499 INFO L290 TraceCheckUtils]: 280: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,499 INFO L290 TraceCheckUtils]: 281: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,499 INFO L290 TraceCheckUtils]: 282: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,500 INFO L290 TraceCheckUtils]: 283: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,500 INFO L290 TraceCheckUtils]: 284: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,500 INFO L290 TraceCheckUtils]: 285: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,500 INFO L290 TraceCheckUtils]: 286: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,500 INFO L290 TraceCheckUtils]: 287: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,501 INFO L290 TraceCheckUtils]: 288: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,501 INFO L290 TraceCheckUtils]: 289: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,501 INFO L290 TraceCheckUtils]: 290: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,501 INFO L290 TraceCheckUtils]: 291: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,501 INFO L290 TraceCheckUtils]: 292: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,502 INFO L290 TraceCheckUtils]: 293: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,502 INFO L290 TraceCheckUtils]: 294: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,502 INFO L290 TraceCheckUtils]: 295: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,502 INFO L290 TraceCheckUtils]: 296: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,502 INFO L290 TraceCheckUtils]: 297: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,503 INFO L290 TraceCheckUtils]: 298: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,503 INFO L290 TraceCheckUtils]: 299: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,503 INFO L290 TraceCheckUtils]: 300: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,503 INFO L290 TraceCheckUtils]: 301: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,504 INFO L290 TraceCheckUtils]: 302: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,504 INFO L290 TraceCheckUtils]: 303: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,504 INFO L290 TraceCheckUtils]: 304: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,504 INFO L290 TraceCheckUtils]: 305: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,504 INFO L290 TraceCheckUtils]: 306: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,505 INFO L290 TraceCheckUtils]: 307: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,505 INFO L290 TraceCheckUtils]: 308: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,505 INFO L290 TraceCheckUtils]: 309: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,505 INFO L290 TraceCheckUtils]: 310: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,505 INFO L290 TraceCheckUtils]: 311: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,506 INFO L290 TraceCheckUtils]: 312: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,506 INFO L290 TraceCheckUtils]: 313: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,506 INFO L290 TraceCheckUtils]: 314: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,506 INFO L290 TraceCheckUtils]: 315: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,506 INFO L290 TraceCheckUtils]: 316: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,507 INFO L290 TraceCheckUtils]: 317: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,507 INFO L290 TraceCheckUtils]: 318: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,507 INFO L290 TraceCheckUtils]: 319: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,507 INFO L290 TraceCheckUtils]: 320: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,507 INFO L290 TraceCheckUtils]: 321: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,508 INFO L290 TraceCheckUtils]: 322: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,508 INFO L290 TraceCheckUtils]: 323: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,508 INFO L290 TraceCheckUtils]: 324: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,508 INFO L290 TraceCheckUtils]: 325: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,508 INFO L290 TraceCheckUtils]: 326: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,509 INFO L290 TraceCheckUtils]: 327: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,509 INFO L290 TraceCheckUtils]: 328: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,509 INFO L290 TraceCheckUtils]: 329: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,509 INFO L290 TraceCheckUtils]: 330: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,509 INFO L290 TraceCheckUtils]: 331: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,510 INFO L290 TraceCheckUtils]: 332: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,510 INFO L290 TraceCheckUtils]: 333: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,510 INFO L290 TraceCheckUtils]: 334: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,510 INFO L290 TraceCheckUtils]: 335: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,511 INFO L290 TraceCheckUtils]: 336: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,511 INFO L290 TraceCheckUtils]: 337: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,511 INFO L290 TraceCheckUtils]: 338: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:42,511 INFO L290 TraceCheckUtils]: 339: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:42,512 INFO L290 TraceCheckUtils]: 340: Hoare triple {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:42,512 INFO L290 TraceCheckUtils]: 341: Hoare triple {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:42,512 INFO L290 TraceCheckUtils]: 342: Hoare triple {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {35717#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:42,513 INFO L290 TraceCheckUtils]: 343: Hoare triple {35717#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !(~i~0 < ~edgecount~0); {35711#false} is VALID [2022-04-08 09:00:42,513 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-08 09:00:42,513 INFO L290 TraceCheckUtils]: 345: Hoare triple {35711#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35711#false} is VALID [2022-04-08 09:00:42,513 INFO L272 TraceCheckUtils]: 346: Hoare triple {35711#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35711#false} is VALID [2022-04-08 09:00:42,513 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-08 09:00:42,513 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-08 09:00:42,513 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-08 09:00:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:00:42,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:42,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397587322] [2022-04-08 09:00:42,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397587322] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:42,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086224291] [2022-04-08 09:00:42,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:00:42,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:42,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:42,515 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:42,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 09:00:42,848 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:00:42,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:42,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:00:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:42,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:44,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35710#true} is VALID [2022-04-08 09:00:44,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {35710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-08 09:00:44,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-08 09:00:44,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-08 09:00:44,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-08 09:00:44,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {35710#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {35737#(<= 20 main_~edgecount~0)} ~i~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,017 INFO L290 TraceCheckUtils]: 60: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,019 INFO L290 TraceCheckUtils]: 66: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,019 INFO L290 TraceCheckUtils]: 67: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,020 INFO L290 TraceCheckUtils]: 70: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,020 INFO L290 TraceCheckUtils]: 71: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,020 INFO L290 TraceCheckUtils]: 73: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,021 INFO L290 TraceCheckUtils]: 74: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,021 INFO L290 TraceCheckUtils]: 75: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,021 INFO L290 TraceCheckUtils]: 76: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,021 INFO L290 TraceCheckUtils]: 77: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,021 INFO L290 TraceCheckUtils]: 78: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,022 INFO L290 TraceCheckUtils]: 79: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,022 INFO L290 TraceCheckUtils]: 80: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,022 INFO L290 TraceCheckUtils]: 81: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,022 INFO L290 TraceCheckUtils]: 82: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,023 INFO L290 TraceCheckUtils]: 83: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,023 INFO L290 TraceCheckUtils]: 84: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,023 INFO L290 TraceCheckUtils]: 85: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,023 INFO L290 TraceCheckUtils]: 86: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,024 INFO L290 TraceCheckUtils]: 87: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,024 INFO L290 TraceCheckUtils]: 88: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,024 INFO L290 TraceCheckUtils]: 89: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,024 INFO L290 TraceCheckUtils]: 90: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,025 INFO L290 TraceCheckUtils]: 91: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,025 INFO L290 TraceCheckUtils]: 92: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,025 INFO L290 TraceCheckUtils]: 93: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,025 INFO L290 TraceCheckUtils]: 94: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,025 INFO L290 TraceCheckUtils]: 95: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,026 INFO L290 TraceCheckUtils]: 96: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,026 INFO L290 TraceCheckUtils]: 97: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,026 INFO L290 TraceCheckUtils]: 98: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,026 INFO L290 TraceCheckUtils]: 99: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,027 INFO L290 TraceCheckUtils]: 100: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,027 INFO L290 TraceCheckUtils]: 101: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,027 INFO L290 TraceCheckUtils]: 102: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,027 INFO L290 TraceCheckUtils]: 103: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,028 INFO L290 TraceCheckUtils]: 104: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,028 INFO L290 TraceCheckUtils]: 105: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,028 INFO L290 TraceCheckUtils]: 106: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,028 INFO L290 TraceCheckUtils]: 107: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,028 INFO L290 TraceCheckUtils]: 108: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,029 INFO L290 TraceCheckUtils]: 109: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,029 INFO L290 TraceCheckUtils]: 110: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,029 INFO L290 TraceCheckUtils]: 111: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,029 INFO L290 TraceCheckUtils]: 112: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,030 INFO L290 TraceCheckUtils]: 113: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,030 INFO L290 TraceCheckUtils]: 114: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,030 INFO L290 TraceCheckUtils]: 115: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,030 INFO L290 TraceCheckUtils]: 116: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,031 INFO L290 TraceCheckUtils]: 117: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,031 INFO L290 TraceCheckUtils]: 118: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,031 INFO L290 TraceCheckUtils]: 119: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,031 INFO L290 TraceCheckUtils]: 120: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,031 INFO L290 TraceCheckUtils]: 121: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,032 INFO L290 TraceCheckUtils]: 122: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,032 INFO L290 TraceCheckUtils]: 123: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,032 INFO L290 TraceCheckUtils]: 124: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,032 INFO L290 TraceCheckUtils]: 125: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,033 INFO L290 TraceCheckUtils]: 126: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,033 INFO L290 TraceCheckUtils]: 127: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,033 INFO L290 TraceCheckUtils]: 128: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,033 INFO L290 TraceCheckUtils]: 129: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,034 INFO L290 TraceCheckUtils]: 130: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,034 INFO L290 TraceCheckUtils]: 131: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,034 INFO L290 TraceCheckUtils]: 132: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,034 INFO L290 TraceCheckUtils]: 133: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,034 INFO L290 TraceCheckUtils]: 134: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,035 INFO L290 TraceCheckUtils]: 135: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,035 INFO L290 TraceCheckUtils]: 136: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,035 INFO L290 TraceCheckUtils]: 137: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,035 INFO L290 TraceCheckUtils]: 138: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,036 INFO L290 TraceCheckUtils]: 139: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,036 INFO L290 TraceCheckUtils]: 140: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,036 INFO L290 TraceCheckUtils]: 141: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,036 INFO L290 TraceCheckUtils]: 142: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,037 INFO L290 TraceCheckUtils]: 143: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,037 INFO L290 TraceCheckUtils]: 144: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,037 INFO L290 TraceCheckUtils]: 145: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,037 INFO L290 TraceCheckUtils]: 146: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,037 INFO L290 TraceCheckUtils]: 147: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,038 INFO L290 TraceCheckUtils]: 148: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,038 INFO L290 TraceCheckUtils]: 149: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,038 INFO L290 TraceCheckUtils]: 150: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,038 INFO L290 TraceCheckUtils]: 151: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,039 INFO L290 TraceCheckUtils]: 152: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,039 INFO L290 TraceCheckUtils]: 153: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,039 INFO L290 TraceCheckUtils]: 154: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,039 INFO L290 TraceCheckUtils]: 155: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,040 INFO L290 TraceCheckUtils]: 156: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,040 INFO L290 TraceCheckUtils]: 157: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,040 INFO L290 TraceCheckUtils]: 158: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,040 INFO L290 TraceCheckUtils]: 159: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,040 INFO L290 TraceCheckUtils]: 160: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,041 INFO L290 TraceCheckUtils]: 161: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,041 INFO L290 TraceCheckUtils]: 162: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,041 INFO L290 TraceCheckUtils]: 163: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,041 INFO L290 TraceCheckUtils]: 164: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,042 INFO L290 TraceCheckUtils]: 165: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,042 INFO L290 TraceCheckUtils]: 166: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,042 INFO L290 TraceCheckUtils]: 167: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,042 INFO L290 TraceCheckUtils]: 168: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,043 INFO L290 TraceCheckUtils]: 169: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,043 INFO L290 TraceCheckUtils]: 170: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,043 INFO L290 TraceCheckUtils]: 171: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,043 INFO L290 TraceCheckUtils]: 172: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,043 INFO L290 TraceCheckUtils]: 173: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,044 INFO L290 TraceCheckUtils]: 174: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,044 INFO L290 TraceCheckUtils]: 175: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,044 INFO L290 TraceCheckUtils]: 176: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,044 INFO L290 TraceCheckUtils]: 177: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,045 INFO L290 TraceCheckUtils]: 178: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,045 INFO L290 TraceCheckUtils]: 179: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,045 INFO L290 TraceCheckUtils]: 180: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,045 INFO L290 TraceCheckUtils]: 181: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,046 INFO L290 TraceCheckUtils]: 182: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,046 INFO L290 TraceCheckUtils]: 183: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,046 INFO L290 TraceCheckUtils]: 184: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,047 INFO L290 TraceCheckUtils]: 185: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,047 INFO L290 TraceCheckUtils]: 186: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,047 INFO L290 TraceCheckUtils]: 187: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,047 INFO L290 TraceCheckUtils]: 188: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,048 INFO L290 TraceCheckUtils]: 189: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,048 INFO L290 TraceCheckUtils]: 190: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,048 INFO L290 TraceCheckUtils]: 191: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,048 INFO L290 TraceCheckUtils]: 192: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,049 INFO L290 TraceCheckUtils]: 193: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,049 INFO L290 TraceCheckUtils]: 194: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,049 INFO L290 TraceCheckUtils]: 195: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,049 INFO L290 TraceCheckUtils]: 196: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,050 INFO L290 TraceCheckUtils]: 197: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,050 INFO L290 TraceCheckUtils]: 198: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,050 INFO L290 TraceCheckUtils]: 199: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,050 INFO L290 TraceCheckUtils]: 200: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,051 INFO L290 TraceCheckUtils]: 201: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,051 INFO L290 TraceCheckUtils]: 202: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,053 INFO L290 TraceCheckUtils]: 203: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,053 INFO L290 TraceCheckUtils]: 204: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,053 INFO L290 TraceCheckUtils]: 205: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,054 INFO L290 TraceCheckUtils]: 206: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,054 INFO L290 TraceCheckUtils]: 207: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,054 INFO L290 TraceCheckUtils]: 208: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,054 INFO L290 TraceCheckUtils]: 209: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,055 INFO L290 TraceCheckUtils]: 210: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,055 INFO L290 TraceCheckUtils]: 211: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,055 INFO L290 TraceCheckUtils]: 212: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,055 INFO L290 TraceCheckUtils]: 213: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,055 INFO L290 TraceCheckUtils]: 214: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,056 INFO L290 TraceCheckUtils]: 215: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,056 INFO L290 TraceCheckUtils]: 216: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,056 INFO L290 TraceCheckUtils]: 217: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,056 INFO L290 TraceCheckUtils]: 218: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,057 INFO L290 TraceCheckUtils]: 219: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,057 INFO L290 TraceCheckUtils]: 220: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,057 INFO L290 TraceCheckUtils]: 221: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,057 INFO L290 TraceCheckUtils]: 222: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,058 INFO L290 TraceCheckUtils]: 223: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,058 INFO L290 TraceCheckUtils]: 224: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,058 INFO L290 TraceCheckUtils]: 225: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,058 INFO L290 TraceCheckUtils]: 226: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,059 INFO L290 TraceCheckUtils]: 227: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,059 INFO L290 TraceCheckUtils]: 228: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,059 INFO L290 TraceCheckUtils]: 229: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,059 INFO L290 TraceCheckUtils]: 230: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,060 INFO L290 TraceCheckUtils]: 231: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,060 INFO L290 TraceCheckUtils]: 232: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,060 INFO L290 TraceCheckUtils]: 233: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,060 INFO L290 TraceCheckUtils]: 234: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,060 INFO L290 TraceCheckUtils]: 235: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,061 INFO L290 TraceCheckUtils]: 236: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,061 INFO L290 TraceCheckUtils]: 237: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,061 INFO L290 TraceCheckUtils]: 238: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,061 INFO L290 TraceCheckUtils]: 239: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,062 INFO L290 TraceCheckUtils]: 240: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,062 INFO L290 TraceCheckUtils]: 241: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,062 INFO L290 TraceCheckUtils]: 242: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,062 INFO L290 TraceCheckUtils]: 243: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,063 INFO L290 TraceCheckUtils]: 244: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,063 INFO L290 TraceCheckUtils]: 245: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,063 INFO L290 TraceCheckUtils]: 246: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,063 INFO L290 TraceCheckUtils]: 247: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,064 INFO L290 TraceCheckUtils]: 248: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,064 INFO L290 TraceCheckUtils]: 249: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,064 INFO L290 TraceCheckUtils]: 250: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,064 INFO L290 TraceCheckUtils]: 251: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,065 INFO L290 TraceCheckUtils]: 252: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,065 INFO L290 TraceCheckUtils]: 253: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,065 INFO L290 TraceCheckUtils]: 254: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,065 INFO L290 TraceCheckUtils]: 255: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,065 INFO L290 TraceCheckUtils]: 256: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,066 INFO L290 TraceCheckUtils]: 257: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,066 INFO L290 TraceCheckUtils]: 258: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,066 INFO L290 TraceCheckUtils]: 259: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,066 INFO L290 TraceCheckUtils]: 260: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,067 INFO L290 TraceCheckUtils]: 261: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,067 INFO L290 TraceCheckUtils]: 262: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,067 INFO L290 TraceCheckUtils]: 263: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,067 INFO L290 TraceCheckUtils]: 264: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,068 INFO L290 TraceCheckUtils]: 265: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,068 INFO L290 TraceCheckUtils]: 266: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,068 INFO L290 TraceCheckUtils]: 267: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,068 INFO L290 TraceCheckUtils]: 268: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,069 INFO L290 TraceCheckUtils]: 269: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,069 INFO L290 TraceCheckUtils]: 270: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,069 INFO L290 TraceCheckUtils]: 271: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,069 INFO L290 TraceCheckUtils]: 272: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,070 INFO L290 TraceCheckUtils]: 273: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,070 INFO L290 TraceCheckUtils]: 274: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,070 INFO L290 TraceCheckUtils]: 275: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,070 INFO L290 TraceCheckUtils]: 276: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,070 INFO L290 TraceCheckUtils]: 277: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,071 INFO L290 TraceCheckUtils]: 278: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,071 INFO L290 TraceCheckUtils]: 279: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,071 INFO L290 TraceCheckUtils]: 280: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,071 INFO L290 TraceCheckUtils]: 281: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,072 INFO L290 TraceCheckUtils]: 282: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,072 INFO L290 TraceCheckUtils]: 283: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,072 INFO L290 TraceCheckUtils]: 284: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,072 INFO L290 TraceCheckUtils]: 285: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,073 INFO L290 TraceCheckUtils]: 286: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,073 INFO L290 TraceCheckUtils]: 287: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,073 INFO L290 TraceCheckUtils]: 288: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,073 INFO L290 TraceCheckUtils]: 289: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,074 INFO L290 TraceCheckUtils]: 290: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,074 INFO L290 TraceCheckUtils]: 291: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,074 INFO L290 TraceCheckUtils]: 292: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,074 INFO L290 TraceCheckUtils]: 293: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,075 INFO L290 TraceCheckUtils]: 294: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,075 INFO L290 TraceCheckUtils]: 295: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,075 INFO L290 TraceCheckUtils]: 296: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,075 INFO L290 TraceCheckUtils]: 297: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,076 INFO L290 TraceCheckUtils]: 298: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,076 INFO L290 TraceCheckUtils]: 299: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,076 INFO L290 TraceCheckUtils]: 300: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,076 INFO L290 TraceCheckUtils]: 301: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,076 INFO L290 TraceCheckUtils]: 302: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,077 INFO L290 TraceCheckUtils]: 303: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,077 INFO L290 TraceCheckUtils]: 304: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,077 INFO L290 TraceCheckUtils]: 305: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,077 INFO L290 TraceCheckUtils]: 306: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,078 INFO L290 TraceCheckUtils]: 307: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,078 INFO L290 TraceCheckUtils]: 308: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,078 INFO L290 TraceCheckUtils]: 309: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,078 INFO L290 TraceCheckUtils]: 310: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,079 INFO L290 TraceCheckUtils]: 311: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,079 INFO L290 TraceCheckUtils]: 312: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,079 INFO L290 TraceCheckUtils]: 313: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,079 INFO L290 TraceCheckUtils]: 314: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,080 INFO L290 TraceCheckUtils]: 315: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,080 INFO L290 TraceCheckUtils]: 316: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,080 INFO L290 TraceCheckUtils]: 317: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,080 INFO L290 TraceCheckUtils]: 318: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,081 INFO L290 TraceCheckUtils]: 319: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,081 INFO L290 TraceCheckUtils]: 320: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,081 INFO L290 TraceCheckUtils]: 321: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,081 INFO L290 TraceCheckUtils]: 322: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,081 INFO L290 TraceCheckUtils]: 323: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,082 INFO L290 TraceCheckUtils]: 324: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,082 INFO L290 TraceCheckUtils]: 325: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,082 INFO L290 TraceCheckUtils]: 326: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,082 INFO L290 TraceCheckUtils]: 327: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,083 INFO L290 TraceCheckUtils]: 328: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,083 INFO L290 TraceCheckUtils]: 329: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,083 INFO L290 TraceCheckUtils]: 330: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,083 INFO L290 TraceCheckUtils]: 331: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,084 INFO L290 TraceCheckUtils]: 332: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,084 INFO L290 TraceCheckUtils]: 333: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,084 INFO L290 TraceCheckUtils]: 334: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,084 INFO L290 TraceCheckUtils]: 335: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,085 INFO L290 TraceCheckUtils]: 336: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,085 INFO L290 TraceCheckUtils]: 337: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,085 INFO L290 TraceCheckUtils]: 338: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:44,085 INFO L290 TraceCheckUtils]: 339: Hoare triple {35737#(<= 20 main_~edgecount~0)} ~i~0 := 0; {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:44,086 INFO L290 TraceCheckUtils]: 340: Hoare triple {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:44,086 INFO L290 TraceCheckUtils]: 341: Hoare triple {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:44,087 INFO L290 TraceCheckUtils]: 342: Hoare triple {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {36750#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:44,087 INFO L290 TraceCheckUtils]: 343: Hoare triple {36750#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {35711#false} is VALID [2022-04-08 09:00:44,087 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-08 09:00:44,087 INFO L290 TraceCheckUtils]: 345: Hoare triple {35711#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35711#false} is VALID [2022-04-08 09:00:44,087 INFO L272 TraceCheckUtils]: 346: Hoare triple {35711#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35711#false} is VALID [2022-04-08 09:00:44,087 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-08 09:00:44,087 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-08 09:00:44,087 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-08 09:00:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 15421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:00:44,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:45,113 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-08 09:00:45,113 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-08 09:00:45,113 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-08 09:00:45,113 INFO L272 TraceCheckUtils]: 346: Hoare triple {35711#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35711#false} is VALID [2022-04-08 09:00:45,113 INFO L290 TraceCheckUtils]: 345: Hoare triple {35711#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35711#false} is VALID [2022-04-08 09:00:45,113 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-08 09:00:45,113 INFO L290 TraceCheckUtils]: 343: Hoare triple {36790#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {35711#false} is VALID [2022-04-08 09:00:45,114 INFO L290 TraceCheckUtils]: 342: Hoare triple {36794#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {36790#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,114 INFO L290 TraceCheckUtils]: 341: Hoare triple {36794#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {36794#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:45,114 INFO L290 TraceCheckUtils]: 340: Hoare triple {36794#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {36794#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:45,115 INFO L290 TraceCheckUtils]: 339: Hoare triple {36804#(< 1 main_~edgecount~0)} ~i~0 := 0; {36794#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:45,115 INFO L290 TraceCheckUtils]: 338: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,115 INFO L290 TraceCheckUtils]: 337: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,115 INFO L290 TraceCheckUtils]: 336: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,116 INFO L290 TraceCheckUtils]: 335: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,116 INFO L290 TraceCheckUtils]: 334: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,116 INFO L290 TraceCheckUtils]: 333: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,116 INFO L290 TraceCheckUtils]: 332: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,117 INFO L290 TraceCheckUtils]: 331: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,117 INFO L290 TraceCheckUtils]: 330: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,117 INFO L290 TraceCheckUtils]: 329: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,117 INFO L290 TraceCheckUtils]: 328: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,117 INFO L290 TraceCheckUtils]: 327: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,118 INFO L290 TraceCheckUtils]: 326: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,118 INFO L290 TraceCheckUtils]: 325: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,118 INFO L290 TraceCheckUtils]: 324: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,118 INFO L290 TraceCheckUtils]: 323: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,119 INFO L290 TraceCheckUtils]: 322: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,119 INFO L290 TraceCheckUtils]: 321: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,119 INFO L290 TraceCheckUtils]: 320: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,119 INFO L290 TraceCheckUtils]: 319: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,120 INFO L290 TraceCheckUtils]: 318: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,121 INFO L290 TraceCheckUtils]: 317: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,121 INFO L290 TraceCheckUtils]: 316: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,121 INFO L290 TraceCheckUtils]: 315: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,122 INFO L290 TraceCheckUtils]: 314: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,122 INFO L290 TraceCheckUtils]: 313: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,122 INFO L290 TraceCheckUtils]: 312: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,122 INFO L290 TraceCheckUtils]: 311: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,122 INFO L290 TraceCheckUtils]: 310: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,123 INFO L290 TraceCheckUtils]: 309: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,123 INFO L290 TraceCheckUtils]: 308: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,123 INFO L290 TraceCheckUtils]: 307: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,123 INFO L290 TraceCheckUtils]: 306: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,124 INFO L290 TraceCheckUtils]: 305: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,124 INFO L290 TraceCheckUtils]: 304: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,124 INFO L290 TraceCheckUtils]: 303: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,124 INFO L290 TraceCheckUtils]: 302: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,125 INFO L290 TraceCheckUtils]: 301: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,125 INFO L290 TraceCheckUtils]: 300: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,125 INFO L290 TraceCheckUtils]: 299: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,125 INFO L290 TraceCheckUtils]: 298: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,126 INFO L290 TraceCheckUtils]: 297: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,126 INFO L290 TraceCheckUtils]: 296: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,126 INFO L290 TraceCheckUtils]: 295: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,126 INFO L290 TraceCheckUtils]: 294: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,127 INFO L290 TraceCheckUtils]: 293: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,127 INFO L290 TraceCheckUtils]: 292: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,127 INFO L290 TraceCheckUtils]: 291: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,127 INFO L290 TraceCheckUtils]: 290: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,128 INFO L290 TraceCheckUtils]: 289: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,128 INFO L290 TraceCheckUtils]: 288: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,128 INFO L290 TraceCheckUtils]: 287: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,128 INFO L290 TraceCheckUtils]: 286: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,129 INFO L290 TraceCheckUtils]: 285: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,129 INFO L290 TraceCheckUtils]: 284: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,129 INFO L290 TraceCheckUtils]: 283: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,129 INFO L290 TraceCheckUtils]: 282: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,130 INFO L290 TraceCheckUtils]: 281: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,130 INFO L290 TraceCheckUtils]: 280: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,130 INFO L290 TraceCheckUtils]: 279: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,130 INFO L290 TraceCheckUtils]: 278: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,130 INFO L290 TraceCheckUtils]: 277: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,131 INFO L290 TraceCheckUtils]: 276: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,131 INFO L290 TraceCheckUtils]: 275: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,131 INFO L290 TraceCheckUtils]: 274: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,131 INFO L290 TraceCheckUtils]: 273: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,132 INFO L290 TraceCheckUtils]: 272: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,132 INFO L290 TraceCheckUtils]: 271: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,132 INFO L290 TraceCheckUtils]: 270: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,132 INFO L290 TraceCheckUtils]: 269: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,133 INFO L290 TraceCheckUtils]: 268: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,133 INFO L290 TraceCheckUtils]: 267: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,133 INFO L290 TraceCheckUtils]: 266: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,134 INFO L290 TraceCheckUtils]: 265: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,134 INFO L290 TraceCheckUtils]: 264: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,134 INFO L290 TraceCheckUtils]: 263: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,134 INFO L290 TraceCheckUtils]: 262: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,135 INFO L290 TraceCheckUtils]: 261: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,135 INFO L290 TraceCheckUtils]: 260: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,135 INFO L290 TraceCheckUtils]: 259: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,135 INFO L290 TraceCheckUtils]: 258: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,136 INFO L290 TraceCheckUtils]: 257: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,136 INFO L290 TraceCheckUtils]: 256: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,136 INFO L290 TraceCheckUtils]: 255: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,136 INFO L290 TraceCheckUtils]: 254: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,137 INFO L290 TraceCheckUtils]: 253: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,137 INFO L290 TraceCheckUtils]: 252: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,137 INFO L290 TraceCheckUtils]: 251: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,137 INFO L290 TraceCheckUtils]: 250: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,137 INFO L290 TraceCheckUtils]: 249: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,138 INFO L290 TraceCheckUtils]: 248: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,138 INFO L290 TraceCheckUtils]: 247: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,138 INFO L290 TraceCheckUtils]: 246: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,138 INFO L290 TraceCheckUtils]: 245: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,139 INFO L290 TraceCheckUtils]: 244: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,139 INFO L290 TraceCheckUtils]: 243: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,139 INFO L290 TraceCheckUtils]: 242: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,139 INFO L290 TraceCheckUtils]: 241: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,140 INFO L290 TraceCheckUtils]: 240: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,140 INFO L290 TraceCheckUtils]: 239: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,140 INFO L290 TraceCheckUtils]: 238: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,140 INFO L290 TraceCheckUtils]: 237: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,141 INFO L290 TraceCheckUtils]: 236: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,141 INFO L290 TraceCheckUtils]: 235: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,141 INFO L290 TraceCheckUtils]: 234: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,141 INFO L290 TraceCheckUtils]: 233: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,142 INFO L290 TraceCheckUtils]: 232: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,142 INFO L290 TraceCheckUtils]: 231: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,142 INFO L290 TraceCheckUtils]: 230: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,142 INFO L290 TraceCheckUtils]: 229: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,142 INFO L290 TraceCheckUtils]: 228: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,143 INFO L290 TraceCheckUtils]: 227: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,143 INFO L290 TraceCheckUtils]: 226: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,143 INFO L290 TraceCheckUtils]: 225: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,143 INFO L290 TraceCheckUtils]: 224: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,144 INFO L290 TraceCheckUtils]: 223: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,144 INFO L290 TraceCheckUtils]: 222: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,144 INFO L290 TraceCheckUtils]: 221: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,144 INFO L290 TraceCheckUtils]: 220: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,145 INFO L290 TraceCheckUtils]: 219: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,145 INFO L290 TraceCheckUtils]: 218: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,145 INFO L290 TraceCheckUtils]: 217: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,145 INFO L290 TraceCheckUtils]: 216: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,146 INFO L290 TraceCheckUtils]: 215: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,146 INFO L290 TraceCheckUtils]: 214: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,146 INFO L290 TraceCheckUtils]: 213: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,146 INFO L290 TraceCheckUtils]: 212: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,146 INFO L290 TraceCheckUtils]: 211: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,147 INFO L290 TraceCheckUtils]: 210: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,147 INFO L290 TraceCheckUtils]: 209: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,147 INFO L290 TraceCheckUtils]: 208: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,147 INFO L290 TraceCheckUtils]: 207: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,148 INFO L290 TraceCheckUtils]: 206: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,148 INFO L290 TraceCheckUtils]: 205: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,148 INFO L290 TraceCheckUtils]: 204: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,148 INFO L290 TraceCheckUtils]: 203: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,149 INFO L290 TraceCheckUtils]: 202: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,149 INFO L290 TraceCheckUtils]: 201: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,149 INFO L290 TraceCheckUtils]: 200: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,149 INFO L290 TraceCheckUtils]: 199: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,150 INFO L290 TraceCheckUtils]: 198: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,150 INFO L290 TraceCheckUtils]: 197: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,150 INFO L290 TraceCheckUtils]: 196: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,150 INFO L290 TraceCheckUtils]: 195: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,150 INFO L290 TraceCheckUtils]: 194: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,151 INFO L290 TraceCheckUtils]: 193: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,151 INFO L290 TraceCheckUtils]: 192: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,151 INFO L290 TraceCheckUtils]: 191: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,151 INFO L290 TraceCheckUtils]: 190: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,152 INFO L290 TraceCheckUtils]: 189: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,152 INFO L290 TraceCheckUtils]: 188: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,152 INFO L290 TraceCheckUtils]: 187: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,152 INFO L290 TraceCheckUtils]: 186: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,153 INFO L290 TraceCheckUtils]: 185: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,153 INFO L290 TraceCheckUtils]: 184: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,153 INFO L290 TraceCheckUtils]: 183: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,153 INFO L290 TraceCheckUtils]: 182: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,154 INFO L290 TraceCheckUtils]: 181: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,154 INFO L290 TraceCheckUtils]: 180: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,154 INFO L290 TraceCheckUtils]: 179: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,154 INFO L290 TraceCheckUtils]: 178: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,155 INFO L290 TraceCheckUtils]: 177: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,155 INFO L290 TraceCheckUtils]: 176: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,155 INFO L290 TraceCheckUtils]: 175: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,155 INFO L290 TraceCheckUtils]: 174: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,156 INFO L290 TraceCheckUtils]: 173: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,156 INFO L290 TraceCheckUtils]: 172: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,156 INFO L290 TraceCheckUtils]: 171: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,156 INFO L290 TraceCheckUtils]: 170: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,156 INFO L290 TraceCheckUtils]: 169: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,157 INFO L290 TraceCheckUtils]: 168: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,157 INFO L290 TraceCheckUtils]: 167: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,157 INFO L290 TraceCheckUtils]: 166: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,157 INFO L290 TraceCheckUtils]: 165: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,158 INFO L290 TraceCheckUtils]: 164: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,158 INFO L290 TraceCheckUtils]: 163: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,158 INFO L290 TraceCheckUtils]: 162: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,158 INFO L290 TraceCheckUtils]: 161: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,159 INFO L290 TraceCheckUtils]: 160: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,159 INFO L290 TraceCheckUtils]: 159: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,159 INFO L290 TraceCheckUtils]: 158: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,159 INFO L290 TraceCheckUtils]: 157: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,160 INFO L290 TraceCheckUtils]: 156: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,160 INFO L290 TraceCheckUtils]: 155: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,160 INFO L290 TraceCheckUtils]: 154: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,160 INFO L290 TraceCheckUtils]: 153: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,160 INFO L290 TraceCheckUtils]: 152: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,161 INFO L290 TraceCheckUtils]: 151: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,161 INFO L290 TraceCheckUtils]: 150: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,161 INFO L290 TraceCheckUtils]: 149: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,161 INFO L290 TraceCheckUtils]: 148: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,162 INFO L290 TraceCheckUtils]: 147: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,162 INFO L290 TraceCheckUtils]: 146: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,162 INFO L290 TraceCheckUtils]: 145: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,162 INFO L290 TraceCheckUtils]: 144: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,163 INFO L290 TraceCheckUtils]: 143: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,163 INFO L290 TraceCheckUtils]: 142: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,163 INFO L290 TraceCheckUtils]: 141: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,163 INFO L290 TraceCheckUtils]: 140: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,164 INFO L290 TraceCheckUtils]: 139: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,164 INFO L290 TraceCheckUtils]: 138: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,164 INFO L290 TraceCheckUtils]: 137: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,164 INFO L290 TraceCheckUtils]: 136: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,165 INFO L290 TraceCheckUtils]: 135: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,165 INFO L290 TraceCheckUtils]: 134: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,165 INFO L290 TraceCheckUtils]: 133: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,165 INFO L290 TraceCheckUtils]: 132: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,165 INFO L290 TraceCheckUtils]: 131: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,166 INFO L290 TraceCheckUtils]: 130: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,166 INFO L290 TraceCheckUtils]: 129: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,166 INFO L290 TraceCheckUtils]: 128: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,166 INFO L290 TraceCheckUtils]: 127: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,167 INFO L290 TraceCheckUtils]: 126: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,167 INFO L290 TraceCheckUtils]: 125: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,167 INFO L290 TraceCheckUtils]: 124: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,167 INFO L290 TraceCheckUtils]: 123: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,168 INFO L290 TraceCheckUtils]: 122: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,168 INFO L290 TraceCheckUtils]: 121: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,168 INFO L290 TraceCheckUtils]: 120: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,168 INFO L290 TraceCheckUtils]: 119: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,169 INFO L290 TraceCheckUtils]: 118: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,169 INFO L290 TraceCheckUtils]: 117: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,169 INFO L290 TraceCheckUtils]: 116: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,169 INFO L290 TraceCheckUtils]: 115: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,169 INFO L290 TraceCheckUtils]: 114: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,170 INFO L290 TraceCheckUtils]: 113: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,170 INFO L290 TraceCheckUtils]: 112: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,170 INFO L290 TraceCheckUtils]: 111: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,170 INFO L290 TraceCheckUtils]: 110: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,171 INFO L290 TraceCheckUtils]: 109: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,171 INFO L290 TraceCheckUtils]: 108: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,171 INFO L290 TraceCheckUtils]: 107: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,171 INFO L290 TraceCheckUtils]: 106: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,172 INFO L290 TraceCheckUtils]: 105: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,172 INFO L290 TraceCheckUtils]: 104: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,172 INFO L290 TraceCheckUtils]: 103: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,172 INFO L290 TraceCheckUtils]: 102: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,173 INFO L290 TraceCheckUtils]: 101: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,173 INFO L290 TraceCheckUtils]: 100: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,173 INFO L290 TraceCheckUtils]: 99: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,173 INFO L290 TraceCheckUtils]: 98: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,174 INFO L290 TraceCheckUtils]: 97: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,174 INFO L290 TraceCheckUtils]: 96: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,174 INFO L290 TraceCheckUtils]: 95: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,174 INFO L290 TraceCheckUtils]: 94: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,175 INFO L290 TraceCheckUtils]: 93: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,175 INFO L290 TraceCheckUtils]: 92: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,175 INFO L290 TraceCheckUtils]: 91: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,175 INFO L290 TraceCheckUtils]: 90: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,176 INFO L290 TraceCheckUtils]: 89: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,176 INFO L290 TraceCheckUtils]: 88: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,176 INFO L290 TraceCheckUtils]: 87: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,176 INFO L290 TraceCheckUtils]: 86: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,177 INFO L290 TraceCheckUtils]: 85: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,177 INFO L290 TraceCheckUtils]: 84: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,177 INFO L290 TraceCheckUtils]: 83: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,177 INFO L290 TraceCheckUtils]: 82: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,177 INFO L290 TraceCheckUtils]: 81: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,178 INFO L290 TraceCheckUtils]: 80: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,178 INFO L290 TraceCheckUtils]: 79: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,178 INFO L290 TraceCheckUtils]: 78: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,178 INFO L290 TraceCheckUtils]: 77: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,179 INFO L290 TraceCheckUtils]: 76: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,179 INFO L290 TraceCheckUtils]: 75: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,179 INFO L290 TraceCheckUtils]: 73: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,180 INFO L290 TraceCheckUtils]: 71: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,180 INFO L290 TraceCheckUtils]: 69: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,181 INFO L290 TraceCheckUtils]: 68: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,181 INFO L290 TraceCheckUtils]: 67: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,181 INFO L290 TraceCheckUtils]: 66: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,182 INFO L290 TraceCheckUtils]: 63: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,182 INFO L290 TraceCheckUtils]: 62: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,182 INFO L290 TraceCheckUtils]: 60: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {36804#(< 1 main_~edgecount~0)} ~i~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {36804#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {35710#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 09:00:45,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-08 09:00:45,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-08 09:00:45,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-08 09:00:45,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {35710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-08 09:00:45,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35710#true} is VALID [2022-04-08 09:00:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:00:45,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086224291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:45,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:45,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-08 09:00:45,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:45,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1814581220] [2022-04-08 09:00:45,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1814581220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:45,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:45,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:00:45,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881295449] [2022-04-08 09:00:45,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:45,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 350 [2022-04-08 09:00:45,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:45,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:45,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:45,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:00:45,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:00:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:00:45,236 INFO L87 Difference]: Start difference. First operand 355 states and 464 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:46,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:46,796 INFO L93 Difference]: Finished difference Result 379 states and 491 transitions. [2022-04-08 09:00:46,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:00:46,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 350 [2022-04-08 09:00:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-04-08 09:00:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-04-08 09:00:46,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2022-04-08 09:00:46,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:46,881 INFO L225 Difference]: With dead ends: 379 [2022-04-08 09:00:46,881 INFO L226 Difference]: Without dead ends: 368 [2022-04-08 09:00:46,881 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2022-04-08 09:00:46,882 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 98 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:46,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 29 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-08 09:00:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 358. [2022-04-08 09:00:48,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:48,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:48,219 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:48,219 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:48,224 INFO L93 Difference]: Finished difference Result 368 states and 479 transitions. [2022-04-08 09:00:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 479 transitions. [2022-04-08 09:00:48,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:48,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:48,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 368 states. [2022-04-08 09:00:48,225 INFO L87 Difference]: Start difference. First operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 368 states. [2022-04-08 09:00:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:48,231 INFO L93 Difference]: Finished difference Result 368 states and 479 transitions. [2022-04-08 09:00:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 479 transitions. [2022-04-08 09:00:48,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:48,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:48,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:48,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 467 transitions. [2022-04-08 09:00:48,237 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 467 transitions. Word has length 350 [2022-04-08 09:00:48,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:48,238 INFO L478 AbstractCegarLoop]: Abstraction has 358 states and 467 transitions. [2022-04-08 09:00:48,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:48,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 358 states and 467 transitions. [2022-04-08 09:00:48,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 467 transitions. [2022-04-08 09:00:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-04-08 09:00:48,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:48,978 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:48,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:49,179 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:49,179 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:49,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:49,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1194423610, now seen corresponding path program 55 times [2022-04-08 09:00:49,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:49,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [70027975] [2022-04-08 09:00:49,183 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:49,183 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1194423610, now seen corresponding path program 56 times [2022-04-08 09:00:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:49,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677425706] [2022-04-08 09:00:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:49,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:49,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {40049#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-08 09:00:49,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-08 09:00:49,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-08 09:00:49,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40049#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:49,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {40049#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-08 09:00:49,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-08 09:00:49,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-08 09:00:49,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-08 09:00:49,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {40040#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,490 INFO L290 TraceCheckUtils]: 47: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,492 INFO L290 TraceCheckUtils]: 55: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,492 INFO L290 TraceCheckUtils]: 56: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,494 INFO L290 TraceCheckUtils]: 64: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,494 INFO L290 TraceCheckUtils]: 65: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,494 INFO L290 TraceCheckUtils]: 66: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,494 INFO L290 TraceCheckUtils]: 67: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,494 INFO L290 TraceCheckUtils]: 68: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,495 INFO L290 TraceCheckUtils]: 69: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,495 INFO L290 TraceCheckUtils]: 70: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,495 INFO L290 TraceCheckUtils]: 71: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,495 INFO L290 TraceCheckUtils]: 72: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,495 INFO L290 TraceCheckUtils]: 73: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,496 INFO L290 TraceCheckUtils]: 74: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,496 INFO L290 TraceCheckUtils]: 75: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,496 INFO L290 TraceCheckUtils]: 76: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,496 INFO L290 TraceCheckUtils]: 77: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,496 INFO L290 TraceCheckUtils]: 78: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,497 INFO L290 TraceCheckUtils]: 81: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,497 INFO L290 TraceCheckUtils]: 82: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,498 INFO L290 TraceCheckUtils]: 83: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,498 INFO L290 TraceCheckUtils]: 84: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,498 INFO L290 TraceCheckUtils]: 85: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,498 INFO L290 TraceCheckUtils]: 86: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,498 INFO L290 TraceCheckUtils]: 87: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,499 INFO L290 TraceCheckUtils]: 88: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,499 INFO L290 TraceCheckUtils]: 89: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,499 INFO L290 TraceCheckUtils]: 90: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,499 INFO L290 TraceCheckUtils]: 91: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,499 INFO L290 TraceCheckUtils]: 92: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,500 INFO L290 TraceCheckUtils]: 93: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,500 INFO L290 TraceCheckUtils]: 94: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,500 INFO L290 TraceCheckUtils]: 95: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,500 INFO L290 TraceCheckUtils]: 96: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,500 INFO L290 TraceCheckUtils]: 97: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,501 INFO L290 TraceCheckUtils]: 98: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,501 INFO L290 TraceCheckUtils]: 99: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,501 INFO L290 TraceCheckUtils]: 100: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,501 INFO L290 TraceCheckUtils]: 101: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,501 INFO L290 TraceCheckUtils]: 102: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,502 INFO L290 TraceCheckUtils]: 103: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,502 INFO L290 TraceCheckUtils]: 104: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,502 INFO L290 TraceCheckUtils]: 105: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,502 INFO L290 TraceCheckUtils]: 106: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,503 INFO L290 TraceCheckUtils]: 107: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,503 INFO L290 TraceCheckUtils]: 108: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,503 INFO L290 TraceCheckUtils]: 109: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,503 INFO L290 TraceCheckUtils]: 110: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,503 INFO L290 TraceCheckUtils]: 111: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,504 INFO L290 TraceCheckUtils]: 112: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,504 INFO L290 TraceCheckUtils]: 113: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,504 INFO L290 TraceCheckUtils]: 114: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,504 INFO L290 TraceCheckUtils]: 115: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,504 INFO L290 TraceCheckUtils]: 116: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,505 INFO L290 TraceCheckUtils]: 117: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,505 INFO L290 TraceCheckUtils]: 118: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,505 INFO L290 TraceCheckUtils]: 119: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,505 INFO L290 TraceCheckUtils]: 120: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,505 INFO L290 TraceCheckUtils]: 121: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,506 INFO L290 TraceCheckUtils]: 122: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,506 INFO L290 TraceCheckUtils]: 123: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,506 INFO L290 TraceCheckUtils]: 124: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,506 INFO L290 TraceCheckUtils]: 125: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,507 INFO L290 TraceCheckUtils]: 126: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,507 INFO L290 TraceCheckUtils]: 127: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,507 INFO L290 TraceCheckUtils]: 128: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,507 INFO L290 TraceCheckUtils]: 129: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,507 INFO L290 TraceCheckUtils]: 130: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,508 INFO L290 TraceCheckUtils]: 131: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,508 INFO L290 TraceCheckUtils]: 132: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,508 INFO L290 TraceCheckUtils]: 133: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,508 INFO L290 TraceCheckUtils]: 134: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,508 INFO L290 TraceCheckUtils]: 135: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,509 INFO L290 TraceCheckUtils]: 136: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,509 INFO L290 TraceCheckUtils]: 137: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,509 INFO L290 TraceCheckUtils]: 138: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,509 INFO L290 TraceCheckUtils]: 139: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,509 INFO L290 TraceCheckUtils]: 140: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,510 INFO L290 TraceCheckUtils]: 141: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,510 INFO L290 TraceCheckUtils]: 142: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,510 INFO L290 TraceCheckUtils]: 143: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,510 INFO L290 TraceCheckUtils]: 144: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,510 INFO L290 TraceCheckUtils]: 145: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,511 INFO L290 TraceCheckUtils]: 146: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,511 INFO L290 TraceCheckUtils]: 147: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,511 INFO L290 TraceCheckUtils]: 148: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,511 INFO L290 TraceCheckUtils]: 149: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,511 INFO L290 TraceCheckUtils]: 150: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,512 INFO L290 TraceCheckUtils]: 151: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,512 INFO L290 TraceCheckUtils]: 152: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,512 INFO L290 TraceCheckUtils]: 153: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,512 INFO L290 TraceCheckUtils]: 154: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,513 INFO L290 TraceCheckUtils]: 155: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,513 INFO L290 TraceCheckUtils]: 156: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,513 INFO L290 TraceCheckUtils]: 157: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,513 INFO L290 TraceCheckUtils]: 158: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,513 INFO L290 TraceCheckUtils]: 159: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,514 INFO L290 TraceCheckUtils]: 160: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,514 INFO L290 TraceCheckUtils]: 161: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,514 INFO L290 TraceCheckUtils]: 162: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,514 INFO L290 TraceCheckUtils]: 163: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,514 INFO L290 TraceCheckUtils]: 164: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,515 INFO L290 TraceCheckUtils]: 165: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,515 INFO L290 TraceCheckUtils]: 166: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,515 INFO L290 TraceCheckUtils]: 167: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,515 INFO L290 TraceCheckUtils]: 168: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,515 INFO L290 TraceCheckUtils]: 169: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,516 INFO L290 TraceCheckUtils]: 170: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,516 INFO L290 TraceCheckUtils]: 171: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,516 INFO L290 TraceCheckUtils]: 172: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,516 INFO L290 TraceCheckUtils]: 173: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,516 INFO L290 TraceCheckUtils]: 174: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,517 INFO L290 TraceCheckUtils]: 175: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,517 INFO L290 TraceCheckUtils]: 176: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,517 INFO L290 TraceCheckUtils]: 177: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,517 INFO L290 TraceCheckUtils]: 178: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,518 INFO L290 TraceCheckUtils]: 179: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,518 INFO L290 TraceCheckUtils]: 180: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,518 INFO L290 TraceCheckUtils]: 181: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,518 INFO L290 TraceCheckUtils]: 182: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,518 INFO L290 TraceCheckUtils]: 183: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,519 INFO L290 TraceCheckUtils]: 184: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,519 INFO L290 TraceCheckUtils]: 185: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,519 INFO L290 TraceCheckUtils]: 186: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,519 INFO L290 TraceCheckUtils]: 187: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,519 INFO L290 TraceCheckUtils]: 188: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,520 INFO L290 TraceCheckUtils]: 189: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,520 INFO L290 TraceCheckUtils]: 190: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,520 INFO L290 TraceCheckUtils]: 191: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,520 INFO L290 TraceCheckUtils]: 192: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,520 INFO L290 TraceCheckUtils]: 193: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,521 INFO L290 TraceCheckUtils]: 194: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,521 INFO L290 TraceCheckUtils]: 195: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,521 INFO L290 TraceCheckUtils]: 196: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,521 INFO L290 TraceCheckUtils]: 197: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,521 INFO L290 TraceCheckUtils]: 198: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,522 INFO L290 TraceCheckUtils]: 199: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,522 INFO L290 TraceCheckUtils]: 200: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,522 INFO L290 TraceCheckUtils]: 201: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,522 INFO L290 TraceCheckUtils]: 202: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,522 INFO L290 TraceCheckUtils]: 203: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,523 INFO L290 TraceCheckUtils]: 204: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,523 INFO L290 TraceCheckUtils]: 205: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,523 INFO L290 TraceCheckUtils]: 206: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,523 INFO L290 TraceCheckUtils]: 207: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,524 INFO L290 TraceCheckUtils]: 208: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,524 INFO L290 TraceCheckUtils]: 209: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,524 INFO L290 TraceCheckUtils]: 210: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,524 INFO L290 TraceCheckUtils]: 211: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,524 INFO L290 TraceCheckUtils]: 212: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,525 INFO L290 TraceCheckUtils]: 213: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,525 INFO L290 TraceCheckUtils]: 214: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,525 INFO L290 TraceCheckUtils]: 215: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,525 INFO L290 TraceCheckUtils]: 216: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,525 INFO L290 TraceCheckUtils]: 217: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,526 INFO L290 TraceCheckUtils]: 218: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,526 INFO L290 TraceCheckUtils]: 219: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,526 INFO L290 TraceCheckUtils]: 220: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,526 INFO L290 TraceCheckUtils]: 221: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,526 INFO L290 TraceCheckUtils]: 222: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,527 INFO L290 TraceCheckUtils]: 223: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,527 INFO L290 TraceCheckUtils]: 224: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,527 INFO L290 TraceCheckUtils]: 225: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,527 INFO L290 TraceCheckUtils]: 226: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,528 INFO L290 TraceCheckUtils]: 227: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,528 INFO L290 TraceCheckUtils]: 228: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,528 INFO L290 TraceCheckUtils]: 229: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,528 INFO L290 TraceCheckUtils]: 230: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,528 INFO L290 TraceCheckUtils]: 231: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,529 INFO L290 TraceCheckUtils]: 232: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,529 INFO L290 TraceCheckUtils]: 233: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,529 INFO L290 TraceCheckUtils]: 234: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,529 INFO L290 TraceCheckUtils]: 235: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,529 INFO L290 TraceCheckUtils]: 236: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,530 INFO L290 TraceCheckUtils]: 237: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,530 INFO L290 TraceCheckUtils]: 238: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,530 INFO L290 TraceCheckUtils]: 239: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,530 INFO L290 TraceCheckUtils]: 240: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,530 INFO L290 TraceCheckUtils]: 241: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,531 INFO L290 TraceCheckUtils]: 242: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,531 INFO L290 TraceCheckUtils]: 243: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,531 INFO L290 TraceCheckUtils]: 244: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,531 INFO L290 TraceCheckUtils]: 245: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,531 INFO L290 TraceCheckUtils]: 246: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,532 INFO L290 TraceCheckUtils]: 247: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,532 INFO L290 TraceCheckUtils]: 248: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,532 INFO L290 TraceCheckUtils]: 249: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,532 INFO L290 TraceCheckUtils]: 250: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,533 INFO L290 TraceCheckUtils]: 251: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,533 INFO L290 TraceCheckUtils]: 252: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,533 INFO L290 TraceCheckUtils]: 253: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,533 INFO L290 TraceCheckUtils]: 254: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,533 INFO L290 TraceCheckUtils]: 255: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,534 INFO L290 TraceCheckUtils]: 256: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,534 INFO L290 TraceCheckUtils]: 257: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,534 INFO L290 TraceCheckUtils]: 258: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,534 INFO L290 TraceCheckUtils]: 259: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,534 INFO L290 TraceCheckUtils]: 260: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,535 INFO L290 TraceCheckUtils]: 261: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,535 INFO L290 TraceCheckUtils]: 262: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,535 INFO L290 TraceCheckUtils]: 263: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,535 INFO L290 TraceCheckUtils]: 264: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,535 INFO L290 TraceCheckUtils]: 265: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,536 INFO L290 TraceCheckUtils]: 266: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,536 INFO L290 TraceCheckUtils]: 267: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,536 INFO L290 TraceCheckUtils]: 268: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,536 INFO L290 TraceCheckUtils]: 269: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,537 INFO L290 TraceCheckUtils]: 270: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,537 INFO L290 TraceCheckUtils]: 271: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,537 INFO L290 TraceCheckUtils]: 272: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,537 INFO L290 TraceCheckUtils]: 273: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,537 INFO L290 TraceCheckUtils]: 274: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,538 INFO L290 TraceCheckUtils]: 275: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,538 INFO L290 TraceCheckUtils]: 276: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,538 INFO L290 TraceCheckUtils]: 277: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,538 INFO L290 TraceCheckUtils]: 278: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,538 INFO L290 TraceCheckUtils]: 279: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,539 INFO L290 TraceCheckUtils]: 280: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,539 INFO L290 TraceCheckUtils]: 281: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,539 INFO L290 TraceCheckUtils]: 282: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,539 INFO L290 TraceCheckUtils]: 283: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,539 INFO L290 TraceCheckUtils]: 284: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,540 INFO L290 TraceCheckUtils]: 285: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,540 INFO L290 TraceCheckUtils]: 286: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,540 INFO L290 TraceCheckUtils]: 287: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,540 INFO L290 TraceCheckUtils]: 288: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,540 INFO L290 TraceCheckUtils]: 289: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,541 INFO L290 TraceCheckUtils]: 290: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,541 INFO L290 TraceCheckUtils]: 291: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,541 INFO L290 TraceCheckUtils]: 292: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,541 INFO L290 TraceCheckUtils]: 293: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,542 INFO L290 TraceCheckUtils]: 294: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,542 INFO L290 TraceCheckUtils]: 295: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,542 INFO L290 TraceCheckUtils]: 296: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,542 INFO L290 TraceCheckUtils]: 297: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,542 INFO L290 TraceCheckUtils]: 298: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,543 INFO L290 TraceCheckUtils]: 299: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,543 INFO L290 TraceCheckUtils]: 300: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,543 INFO L290 TraceCheckUtils]: 301: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,543 INFO L290 TraceCheckUtils]: 302: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,543 INFO L290 TraceCheckUtils]: 303: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,544 INFO L290 TraceCheckUtils]: 304: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,544 INFO L290 TraceCheckUtils]: 305: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,544 INFO L290 TraceCheckUtils]: 306: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,544 INFO L290 TraceCheckUtils]: 307: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,544 INFO L290 TraceCheckUtils]: 308: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,545 INFO L290 TraceCheckUtils]: 309: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,545 INFO L290 TraceCheckUtils]: 310: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,545 INFO L290 TraceCheckUtils]: 311: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,545 INFO L290 TraceCheckUtils]: 312: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,546 INFO L290 TraceCheckUtils]: 313: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,546 INFO L290 TraceCheckUtils]: 314: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,546 INFO L290 TraceCheckUtils]: 315: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,546 INFO L290 TraceCheckUtils]: 316: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,546 INFO L290 TraceCheckUtils]: 317: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,547 INFO L290 TraceCheckUtils]: 318: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,547 INFO L290 TraceCheckUtils]: 319: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,547 INFO L290 TraceCheckUtils]: 320: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,547 INFO L290 TraceCheckUtils]: 321: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,547 INFO L290 TraceCheckUtils]: 322: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,548 INFO L290 TraceCheckUtils]: 323: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,548 INFO L290 TraceCheckUtils]: 324: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,548 INFO L290 TraceCheckUtils]: 325: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,548 INFO L290 TraceCheckUtils]: 326: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,548 INFO L290 TraceCheckUtils]: 327: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,549 INFO L290 TraceCheckUtils]: 328: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,549 INFO L290 TraceCheckUtils]: 329: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,549 INFO L290 TraceCheckUtils]: 330: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,549 INFO L290 TraceCheckUtils]: 331: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,549 INFO L290 TraceCheckUtils]: 332: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,550 INFO L290 TraceCheckUtils]: 333: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,550 INFO L290 TraceCheckUtils]: 334: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,550 INFO L290 TraceCheckUtils]: 335: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,550 INFO L290 TraceCheckUtils]: 336: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,551 INFO L290 TraceCheckUtils]: 337: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,551 INFO L290 TraceCheckUtils]: 338: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:49,551 INFO L290 TraceCheckUtils]: 339: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:49,552 INFO L290 TraceCheckUtils]: 340: Hoare triple {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:49,552 INFO L290 TraceCheckUtils]: 341: Hoare triple {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:49,552 INFO L290 TraceCheckUtils]: 342: Hoare triple {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:49,552 INFO L290 TraceCheckUtils]: 343: Hoare triple {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:49,553 INFO L290 TraceCheckUtils]: 344: Hoare triple {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:00:49,553 INFO L290 TraceCheckUtils]: 345: Hoare triple {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {40048#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:00:49,553 INFO L290 TraceCheckUtils]: 346: Hoare triple {40048#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {40041#false} is VALID [2022-04-08 09:00:49,553 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-08 09:00:49,554 INFO L290 TraceCheckUtils]: 348: Hoare triple {40041#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40041#false} is VALID [2022-04-08 09:00:49,554 INFO L272 TraceCheckUtils]: 349: Hoare triple {40041#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40041#false} is VALID [2022-04-08 09:00:49,554 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-08 09:00:49,554 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-08 09:00:49,554 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-08 09:00:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15425 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:00:49,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:49,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677425706] [2022-04-08 09:00:49,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677425706] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:49,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940462149] [2022-04-08 09:00:49,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:49,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:49,556 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:49,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 09:00:50,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:50,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:50,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 2151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 09:00:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:50,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:51,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40040#true} is VALID [2022-04-08 09:00:51,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {40040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-08 09:00:51,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-08 09:00:51,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-08 09:00:51,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-08 09:00:51,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {40040#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,284 INFO L290 TraceCheckUtils]: 43: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,284 INFO L290 TraceCheckUtils]: 44: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,286 INFO L290 TraceCheckUtils]: 51: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,288 INFO L290 TraceCheckUtils]: 61: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,288 INFO L290 TraceCheckUtils]: 62: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,290 INFO L290 TraceCheckUtils]: 67: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,290 INFO L290 TraceCheckUtils]: 68: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,290 INFO L290 TraceCheckUtils]: 69: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,290 INFO L290 TraceCheckUtils]: 70: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,291 INFO L290 TraceCheckUtils]: 71: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,291 INFO L290 TraceCheckUtils]: 72: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,291 INFO L290 TraceCheckUtils]: 73: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,291 INFO L290 TraceCheckUtils]: 74: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,292 INFO L290 TraceCheckUtils]: 75: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,292 INFO L290 TraceCheckUtils]: 76: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,292 INFO L290 TraceCheckUtils]: 77: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,292 INFO L290 TraceCheckUtils]: 78: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,292 INFO L290 TraceCheckUtils]: 79: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,293 INFO L290 TraceCheckUtils]: 80: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,293 INFO L290 TraceCheckUtils]: 81: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,293 INFO L290 TraceCheckUtils]: 82: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,293 INFO L290 TraceCheckUtils]: 83: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,294 INFO L290 TraceCheckUtils]: 84: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,294 INFO L290 TraceCheckUtils]: 85: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,294 INFO L290 TraceCheckUtils]: 86: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,294 INFO L290 TraceCheckUtils]: 87: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,295 INFO L290 TraceCheckUtils]: 88: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,295 INFO L290 TraceCheckUtils]: 89: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,295 INFO L290 TraceCheckUtils]: 90: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,295 INFO L290 TraceCheckUtils]: 91: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,296 INFO L290 TraceCheckUtils]: 92: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,296 INFO L290 TraceCheckUtils]: 93: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,296 INFO L290 TraceCheckUtils]: 94: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,296 INFO L290 TraceCheckUtils]: 95: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,296 INFO L290 TraceCheckUtils]: 96: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,297 INFO L290 TraceCheckUtils]: 97: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,297 INFO L290 TraceCheckUtils]: 98: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,297 INFO L290 TraceCheckUtils]: 99: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,297 INFO L290 TraceCheckUtils]: 100: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,298 INFO L290 TraceCheckUtils]: 101: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,298 INFO L290 TraceCheckUtils]: 102: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,298 INFO L290 TraceCheckUtils]: 103: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,298 INFO L290 TraceCheckUtils]: 104: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,299 INFO L290 TraceCheckUtils]: 105: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,299 INFO L290 TraceCheckUtils]: 106: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,299 INFO L290 TraceCheckUtils]: 107: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,299 INFO L290 TraceCheckUtils]: 108: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,300 INFO L290 TraceCheckUtils]: 109: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,300 INFO L290 TraceCheckUtils]: 110: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,300 INFO L290 TraceCheckUtils]: 111: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,300 INFO L290 TraceCheckUtils]: 112: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,300 INFO L290 TraceCheckUtils]: 113: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,301 INFO L290 TraceCheckUtils]: 114: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,301 INFO L290 TraceCheckUtils]: 115: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,301 INFO L290 TraceCheckUtils]: 116: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,301 INFO L290 TraceCheckUtils]: 117: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,302 INFO L290 TraceCheckUtils]: 118: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,302 INFO L290 TraceCheckUtils]: 119: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,302 INFO L290 TraceCheckUtils]: 120: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,302 INFO L290 TraceCheckUtils]: 121: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,303 INFO L290 TraceCheckUtils]: 122: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,303 INFO L290 TraceCheckUtils]: 123: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,303 INFO L290 TraceCheckUtils]: 124: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,303 INFO L290 TraceCheckUtils]: 125: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,304 INFO L290 TraceCheckUtils]: 126: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,304 INFO L290 TraceCheckUtils]: 127: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,304 INFO L290 TraceCheckUtils]: 128: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,304 INFO L290 TraceCheckUtils]: 129: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,304 INFO L290 TraceCheckUtils]: 130: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,305 INFO L290 TraceCheckUtils]: 131: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,305 INFO L290 TraceCheckUtils]: 132: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,305 INFO L290 TraceCheckUtils]: 133: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,305 INFO L290 TraceCheckUtils]: 134: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,306 INFO L290 TraceCheckUtils]: 135: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,306 INFO L290 TraceCheckUtils]: 136: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,306 INFO L290 TraceCheckUtils]: 137: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,306 INFO L290 TraceCheckUtils]: 138: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,307 INFO L290 TraceCheckUtils]: 139: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,307 INFO L290 TraceCheckUtils]: 140: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,307 INFO L290 TraceCheckUtils]: 141: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,307 INFO L290 TraceCheckUtils]: 142: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,308 INFO L290 TraceCheckUtils]: 143: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,308 INFO L290 TraceCheckUtils]: 144: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,308 INFO L290 TraceCheckUtils]: 145: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,308 INFO L290 TraceCheckUtils]: 146: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,308 INFO L290 TraceCheckUtils]: 147: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,309 INFO L290 TraceCheckUtils]: 148: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,309 INFO L290 TraceCheckUtils]: 149: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,309 INFO L290 TraceCheckUtils]: 150: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,309 INFO L290 TraceCheckUtils]: 151: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,310 INFO L290 TraceCheckUtils]: 152: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,310 INFO L290 TraceCheckUtils]: 153: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,310 INFO L290 TraceCheckUtils]: 154: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,310 INFO L290 TraceCheckUtils]: 155: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,311 INFO L290 TraceCheckUtils]: 156: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,311 INFO L290 TraceCheckUtils]: 157: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,311 INFO L290 TraceCheckUtils]: 158: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,311 INFO L290 TraceCheckUtils]: 159: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,311 INFO L290 TraceCheckUtils]: 160: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,312 INFO L290 TraceCheckUtils]: 161: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,312 INFO L290 TraceCheckUtils]: 162: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,312 INFO L290 TraceCheckUtils]: 163: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,312 INFO L290 TraceCheckUtils]: 164: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,313 INFO L290 TraceCheckUtils]: 165: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,313 INFO L290 TraceCheckUtils]: 166: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,313 INFO L290 TraceCheckUtils]: 167: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,313 INFO L290 TraceCheckUtils]: 168: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,314 INFO L290 TraceCheckUtils]: 169: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,314 INFO L290 TraceCheckUtils]: 170: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,314 INFO L290 TraceCheckUtils]: 171: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,314 INFO L290 TraceCheckUtils]: 172: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,315 INFO L290 TraceCheckUtils]: 173: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,315 INFO L290 TraceCheckUtils]: 174: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,315 INFO L290 TraceCheckUtils]: 175: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,315 INFO L290 TraceCheckUtils]: 176: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,315 INFO L290 TraceCheckUtils]: 177: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,316 INFO L290 TraceCheckUtils]: 178: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,316 INFO L290 TraceCheckUtils]: 179: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,316 INFO L290 TraceCheckUtils]: 180: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,316 INFO L290 TraceCheckUtils]: 181: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,317 INFO L290 TraceCheckUtils]: 182: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,317 INFO L290 TraceCheckUtils]: 183: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,317 INFO L290 TraceCheckUtils]: 184: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,317 INFO L290 TraceCheckUtils]: 185: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,318 INFO L290 TraceCheckUtils]: 186: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,318 INFO L290 TraceCheckUtils]: 187: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,318 INFO L290 TraceCheckUtils]: 188: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,318 INFO L290 TraceCheckUtils]: 189: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,319 INFO L290 TraceCheckUtils]: 190: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,319 INFO L290 TraceCheckUtils]: 191: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,319 INFO L290 TraceCheckUtils]: 192: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,319 INFO L290 TraceCheckUtils]: 193: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,319 INFO L290 TraceCheckUtils]: 194: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,320 INFO L290 TraceCheckUtils]: 195: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,321 INFO L290 TraceCheckUtils]: 196: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,321 INFO L290 TraceCheckUtils]: 197: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,321 INFO L290 TraceCheckUtils]: 198: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,321 INFO L290 TraceCheckUtils]: 199: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,322 INFO L290 TraceCheckUtils]: 200: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,322 INFO L290 TraceCheckUtils]: 201: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,322 INFO L290 TraceCheckUtils]: 202: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,322 INFO L290 TraceCheckUtils]: 203: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,323 INFO L290 TraceCheckUtils]: 204: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,323 INFO L290 TraceCheckUtils]: 205: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,323 INFO L290 TraceCheckUtils]: 206: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,323 INFO L290 TraceCheckUtils]: 207: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,324 INFO L290 TraceCheckUtils]: 208: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,324 INFO L290 TraceCheckUtils]: 209: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,324 INFO L290 TraceCheckUtils]: 210: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,324 INFO L290 TraceCheckUtils]: 211: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,325 INFO L290 TraceCheckUtils]: 212: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,325 INFO L290 TraceCheckUtils]: 213: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,325 INFO L290 TraceCheckUtils]: 214: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,325 INFO L290 TraceCheckUtils]: 215: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,325 INFO L290 TraceCheckUtils]: 216: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,326 INFO L290 TraceCheckUtils]: 217: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,326 INFO L290 TraceCheckUtils]: 218: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,326 INFO L290 TraceCheckUtils]: 219: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,326 INFO L290 TraceCheckUtils]: 220: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,327 INFO L290 TraceCheckUtils]: 221: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,327 INFO L290 TraceCheckUtils]: 222: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,327 INFO L290 TraceCheckUtils]: 223: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,327 INFO L290 TraceCheckUtils]: 224: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,328 INFO L290 TraceCheckUtils]: 225: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,328 INFO L290 TraceCheckUtils]: 226: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,328 INFO L290 TraceCheckUtils]: 227: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,328 INFO L290 TraceCheckUtils]: 228: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,329 INFO L290 TraceCheckUtils]: 229: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,329 INFO L290 TraceCheckUtils]: 230: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,329 INFO L290 TraceCheckUtils]: 231: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,329 INFO L290 TraceCheckUtils]: 232: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,329 INFO L290 TraceCheckUtils]: 233: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,330 INFO L290 TraceCheckUtils]: 234: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,330 INFO L290 TraceCheckUtils]: 235: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,330 INFO L290 TraceCheckUtils]: 236: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,330 INFO L290 TraceCheckUtils]: 237: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,331 INFO L290 TraceCheckUtils]: 238: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,331 INFO L290 TraceCheckUtils]: 239: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,331 INFO L290 TraceCheckUtils]: 240: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,331 INFO L290 TraceCheckUtils]: 241: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,332 INFO L290 TraceCheckUtils]: 242: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,332 INFO L290 TraceCheckUtils]: 243: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,332 INFO L290 TraceCheckUtils]: 244: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,332 INFO L290 TraceCheckUtils]: 245: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,333 INFO L290 TraceCheckUtils]: 246: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,333 INFO L290 TraceCheckUtils]: 247: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,333 INFO L290 TraceCheckUtils]: 248: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,333 INFO L290 TraceCheckUtils]: 249: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,333 INFO L290 TraceCheckUtils]: 250: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,334 INFO L290 TraceCheckUtils]: 251: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,334 INFO L290 TraceCheckUtils]: 252: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,334 INFO L290 TraceCheckUtils]: 253: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,334 INFO L290 TraceCheckUtils]: 254: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,335 INFO L290 TraceCheckUtils]: 255: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,335 INFO L290 TraceCheckUtils]: 256: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,335 INFO L290 TraceCheckUtils]: 257: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,335 INFO L290 TraceCheckUtils]: 258: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,336 INFO L290 TraceCheckUtils]: 259: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,336 INFO L290 TraceCheckUtils]: 260: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,336 INFO L290 TraceCheckUtils]: 261: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,336 INFO L290 TraceCheckUtils]: 262: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,336 INFO L290 TraceCheckUtils]: 263: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,337 INFO L290 TraceCheckUtils]: 264: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,337 INFO L290 TraceCheckUtils]: 265: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,337 INFO L290 TraceCheckUtils]: 266: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,337 INFO L290 TraceCheckUtils]: 267: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,338 INFO L290 TraceCheckUtils]: 268: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,338 INFO L290 TraceCheckUtils]: 269: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,338 INFO L290 TraceCheckUtils]: 270: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,338 INFO L290 TraceCheckUtils]: 271: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,339 INFO L290 TraceCheckUtils]: 272: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,339 INFO L290 TraceCheckUtils]: 273: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,339 INFO L290 TraceCheckUtils]: 274: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,339 INFO L290 TraceCheckUtils]: 275: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,340 INFO L290 TraceCheckUtils]: 276: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,340 INFO L290 TraceCheckUtils]: 277: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,340 INFO L290 TraceCheckUtils]: 278: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,340 INFO L290 TraceCheckUtils]: 279: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,340 INFO L290 TraceCheckUtils]: 280: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,341 INFO L290 TraceCheckUtils]: 281: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,341 INFO L290 TraceCheckUtils]: 282: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,341 INFO L290 TraceCheckUtils]: 283: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,341 INFO L290 TraceCheckUtils]: 284: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,342 INFO L290 TraceCheckUtils]: 285: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,342 INFO L290 TraceCheckUtils]: 286: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,342 INFO L290 TraceCheckUtils]: 287: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,342 INFO L290 TraceCheckUtils]: 288: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,343 INFO L290 TraceCheckUtils]: 289: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,343 INFO L290 TraceCheckUtils]: 290: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,343 INFO L290 TraceCheckUtils]: 291: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,343 INFO L290 TraceCheckUtils]: 292: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,344 INFO L290 TraceCheckUtils]: 293: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,344 INFO L290 TraceCheckUtils]: 294: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,344 INFO L290 TraceCheckUtils]: 295: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,344 INFO L290 TraceCheckUtils]: 296: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,344 INFO L290 TraceCheckUtils]: 297: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,345 INFO L290 TraceCheckUtils]: 298: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,345 INFO L290 TraceCheckUtils]: 299: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,345 INFO L290 TraceCheckUtils]: 300: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,345 INFO L290 TraceCheckUtils]: 301: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,346 INFO L290 TraceCheckUtils]: 302: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,346 INFO L290 TraceCheckUtils]: 303: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,346 INFO L290 TraceCheckUtils]: 304: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,346 INFO L290 TraceCheckUtils]: 305: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,347 INFO L290 TraceCheckUtils]: 306: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,347 INFO L290 TraceCheckUtils]: 307: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,347 INFO L290 TraceCheckUtils]: 308: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,347 INFO L290 TraceCheckUtils]: 309: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,347 INFO L290 TraceCheckUtils]: 310: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,348 INFO L290 TraceCheckUtils]: 311: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,348 INFO L290 TraceCheckUtils]: 312: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,348 INFO L290 TraceCheckUtils]: 313: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,348 INFO L290 TraceCheckUtils]: 314: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,349 INFO L290 TraceCheckUtils]: 315: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,349 INFO L290 TraceCheckUtils]: 316: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,349 INFO L290 TraceCheckUtils]: 317: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,349 INFO L290 TraceCheckUtils]: 318: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,350 INFO L290 TraceCheckUtils]: 319: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,350 INFO L290 TraceCheckUtils]: 320: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,350 INFO L290 TraceCheckUtils]: 321: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,350 INFO L290 TraceCheckUtils]: 322: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,351 INFO L290 TraceCheckUtils]: 323: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,351 INFO L290 TraceCheckUtils]: 324: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,351 INFO L290 TraceCheckUtils]: 325: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,351 INFO L290 TraceCheckUtils]: 326: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,351 INFO L290 TraceCheckUtils]: 327: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,352 INFO L290 TraceCheckUtils]: 328: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,352 INFO L290 TraceCheckUtils]: 329: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,352 INFO L290 TraceCheckUtils]: 330: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,352 INFO L290 TraceCheckUtils]: 331: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,353 INFO L290 TraceCheckUtils]: 332: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,353 INFO L290 TraceCheckUtils]: 333: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,353 INFO L290 TraceCheckUtils]: 334: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,353 INFO L290 TraceCheckUtils]: 335: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,354 INFO L290 TraceCheckUtils]: 336: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,354 INFO L290 TraceCheckUtils]: 337: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,354 INFO L290 TraceCheckUtils]: 338: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:00:51,354 INFO L290 TraceCheckUtils]: 339: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:51,355 INFO L290 TraceCheckUtils]: 340: Hoare triple {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:51,355 INFO L290 TraceCheckUtils]: 341: Hoare triple {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:51,356 INFO L290 TraceCheckUtils]: 342: Hoare triple {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:51,356 INFO L290 TraceCheckUtils]: 343: Hoare triple {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:51,356 INFO L290 TraceCheckUtils]: 344: Hoare triple {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:00:51,357 INFO L290 TraceCheckUtils]: 345: Hoare triple {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41090#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:51,357 INFO L290 TraceCheckUtils]: 346: Hoare triple {41090#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(~i~0 < ~edgecount~0); {40041#false} is VALID [2022-04-08 09:00:51,357 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-08 09:00:51,357 INFO L290 TraceCheckUtils]: 348: Hoare triple {40041#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40041#false} is VALID [2022-04-08 09:00:51,357 INFO L272 TraceCheckUtils]: 349: Hoare triple {40041#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40041#false} is VALID [2022-04-08 09:00:51,357 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-08 09:00:51,357 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-08 09:00:51,357 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-08 09:00:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15425 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:00:51,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:52,443 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-08 09:00:52,444 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-08 09:00:52,444 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-08 09:00:52,444 INFO L272 TraceCheckUtils]: 349: Hoare triple {40041#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40041#false} is VALID [2022-04-08 09:00:52,444 INFO L290 TraceCheckUtils]: 348: Hoare triple {40041#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40041#false} is VALID [2022-04-08 09:00:52,444 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-08 09:00:52,444 INFO L290 TraceCheckUtils]: 346: Hoare triple {41130#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {40041#false} is VALID [2022-04-08 09:00:52,444 INFO L290 TraceCheckUtils]: 345: Hoare triple {41134#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41130#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,445 INFO L290 TraceCheckUtils]: 344: Hoare triple {41134#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41134#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:52,445 INFO L290 TraceCheckUtils]: 343: Hoare triple {41134#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41134#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:52,445 INFO L290 TraceCheckUtils]: 342: Hoare triple {41144#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41134#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:00:52,446 INFO L290 TraceCheckUtils]: 341: Hoare triple {41144#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41144#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:00:52,446 INFO L290 TraceCheckUtils]: 340: Hoare triple {41144#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41144#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:00:52,446 INFO L290 TraceCheckUtils]: 339: Hoare triple {41154#(< 2 main_~edgecount~0)} ~i~0 := 0; {41144#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:00:52,446 INFO L290 TraceCheckUtils]: 338: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,447 INFO L290 TraceCheckUtils]: 337: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,447 INFO L290 TraceCheckUtils]: 336: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,447 INFO L290 TraceCheckUtils]: 335: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,447 INFO L290 TraceCheckUtils]: 334: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,448 INFO L290 TraceCheckUtils]: 333: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,448 INFO L290 TraceCheckUtils]: 332: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,448 INFO L290 TraceCheckUtils]: 331: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,448 INFO L290 TraceCheckUtils]: 330: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,448 INFO L290 TraceCheckUtils]: 329: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,449 INFO L290 TraceCheckUtils]: 328: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,449 INFO L290 TraceCheckUtils]: 327: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,449 INFO L290 TraceCheckUtils]: 326: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,449 INFO L290 TraceCheckUtils]: 325: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,450 INFO L290 TraceCheckUtils]: 324: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,450 INFO L290 TraceCheckUtils]: 323: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,450 INFO L290 TraceCheckUtils]: 322: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,450 INFO L290 TraceCheckUtils]: 321: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,451 INFO L290 TraceCheckUtils]: 320: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,451 INFO L290 TraceCheckUtils]: 319: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,451 INFO L290 TraceCheckUtils]: 318: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,451 INFO L290 TraceCheckUtils]: 317: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,452 INFO L290 TraceCheckUtils]: 316: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,452 INFO L290 TraceCheckUtils]: 315: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,452 INFO L290 TraceCheckUtils]: 314: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,452 INFO L290 TraceCheckUtils]: 313: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,452 INFO L290 TraceCheckUtils]: 312: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,453 INFO L290 TraceCheckUtils]: 311: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,453 INFO L290 TraceCheckUtils]: 310: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,453 INFO L290 TraceCheckUtils]: 309: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,453 INFO L290 TraceCheckUtils]: 308: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,454 INFO L290 TraceCheckUtils]: 307: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,454 INFO L290 TraceCheckUtils]: 306: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,454 INFO L290 TraceCheckUtils]: 305: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,454 INFO L290 TraceCheckUtils]: 304: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,455 INFO L290 TraceCheckUtils]: 303: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,455 INFO L290 TraceCheckUtils]: 302: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,455 INFO L290 TraceCheckUtils]: 301: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,455 INFO L290 TraceCheckUtils]: 300: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,456 INFO L290 TraceCheckUtils]: 299: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,456 INFO L290 TraceCheckUtils]: 298: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,456 INFO L290 TraceCheckUtils]: 297: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,456 INFO L290 TraceCheckUtils]: 296: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,456 INFO L290 TraceCheckUtils]: 295: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,457 INFO L290 TraceCheckUtils]: 294: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,457 INFO L290 TraceCheckUtils]: 293: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,457 INFO L290 TraceCheckUtils]: 292: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,457 INFO L290 TraceCheckUtils]: 291: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,458 INFO L290 TraceCheckUtils]: 290: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,458 INFO L290 TraceCheckUtils]: 289: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,458 INFO L290 TraceCheckUtils]: 288: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,458 INFO L290 TraceCheckUtils]: 287: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,459 INFO L290 TraceCheckUtils]: 286: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,459 INFO L290 TraceCheckUtils]: 285: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,459 INFO L290 TraceCheckUtils]: 284: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,459 INFO L290 TraceCheckUtils]: 283: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,460 INFO L290 TraceCheckUtils]: 282: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,460 INFO L290 TraceCheckUtils]: 281: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,460 INFO L290 TraceCheckUtils]: 280: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,460 INFO L290 TraceCheckUtils]: 279: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,460 INFO L290 TraceCheckUtils]: 278: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,461 INFO L290 TraceCheckUtils]: 277: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,461 INFO L290 TraceCheckUtils]: 276: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,461 INFO L290 TraceCheckUtils]: 275: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,461 INFO L290 TraceCheckUtils]: 274: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,462 INFO L290 TraceCheckUtils]: 273: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,462 INFO L290 TraceCheckUtils]: 272: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,462 INFO L290 TraceCheckUtils]: 271: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,462 INFO L290 TraceCheckUtils]: 270: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,463 INFO L290 TraceCheckUtils]: 269: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,463 INFO L290 TraceCheckUtils]: 268: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,463 INFO L290 TraceCheckUtils]: 267: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,463 INFO L290 TraceCheckUtils]: 266: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,464 INFO L290 TraceCheckUtils]: 265: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,464 INFO L290 TraceCheckUtils]: 264: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,464 INFO L290 TraceCheckUtils]: 263: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,464 INFO L290 TraceCheckUtils]: 262: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,464 INFO L290 TraceCheckUtils]: 261: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,465 INFO L290 TraceCheckUtils]: 260: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,465 INFO L290 TraceCheckUtils]: 259: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,465 INFO L290 TraceCheckUtils]: 258: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,465 INFO L290 TraceCheckUtils]: 257: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,466 INFO L290 TraceCheckUtils]: 256: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,466 INFO L290 TraceCheckUtils]: 255: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,466 INFO L290 TraceCheckUtils]: 254: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,466 INFO L290 TraceCheckUtils]: 253: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,467 INFO L290 TraceCheckUtils]: 252: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,467 INFO L290 TraceCheckUtils]: 251: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,467 INFO L290 TraceCheckUtils]: 250: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,467 INFO L290 TraceCheckUtils]: 249: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,468 INFO L290 TraceCheckUtils]: 248: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,468 INFO L290 TraceCheckUtils]: 247: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,468 INFO L290 TraceCheckUtils]: 246: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,468 INFO L290 TraceCheckUtils]: 245: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,468 INFO L290 TraceCheckUtils]: 244: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,469 INFO L290 TraceCheckUtils]: 243: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,469 INFO L290 TraceCheckUtils]: 242: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,469 INFO L290 TraceCheckUtils]: 241: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,469 INFO L290 TraceCheckUtils]: 240: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,470 INFO L290 TraceCheckUtils]: 239: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,470 INFO L290 TraceCheckUtils]: 238: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,470 INFO L290 TraceCheckUtils]: 237: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,470 INFO L290 TraceCheckUtils]: 236: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,471 INFO L290 TraceCheckUtils]: 235: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,471 INFO L290 TraceCheckUtils]: 234: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,471 INFO L290 TraceCheckUtils]: 233: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,471 INFO L290 TraceCheckUtils]: 232: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,471 INFO L290 TraceCheckUtils]: 231: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,472 INFO L290 TraceCheckUtils]: 230: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,472 INFO L290 TraceCheckUtils]: 229: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,472 INFO L290 TraceCheckUtils]: 228: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,472 INFO L290 TraceCheckUtils]: 227: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,473 INFO L290 TraceCheckUtils]: 226: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,473 INFO L290 TraceCheckUtils]: 225: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,473 INFO L290 TraceCheckUtils]: 224: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,473 INFO L290 TraceCheckUtils]: 223: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,474 INFO L290 TraceCheckUtils]: 222: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,474 INFO L290 TraceCheckUtils]: 221: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,474 INFO L290 TraceCheckUtils]: 220: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,474 INFO L290 TraceCheckUtils]: 219: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,475 INFO L290 TraceCheckUtils]: 218: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,475 INFO L290 TraceCheckUtils]: 217: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,475 INFO L290 TraceCheckUtils]: 216: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,475 INFO L290 TraceCheckUtils]: 215: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,475 INFO L290 TraceCheckUtils]: 214: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,476 INFO L290 TraceCheckUtils]: 213: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,476 INFO L290 TraceCheckUtils]: 212: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,476 INFO L290 TraceCheckUtils]: 211: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,476 INFO L290 TraceCheckUtils]: 210: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,477 INFO L290 TraceCheckUtils]: 209: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,477 INFO L290 TraceCheckUtils]: 208: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,477 INFO L290 TraceCheckUtils]: 207: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,477 INFO L290 TraceCheckUtils]: 206: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,478 INFO L290 TraceCheckUtils]: 205: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,478 INFO L290 TraceCheckUtils]: 204: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,478 INFO L290 TraceCheckUtils]: 203: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,478 INFO L290 TraceCheckUtils]: 202: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,479 INFO L290 TraceCheckUtils]: 201: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,479 INFO L290 TraceCheckUtils]: 200: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,479 INFO L290 TraceCheckUtils]: 199: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,479 INFO L290 TraceCheckUtils]: 198: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,479 INFO L290 TraceCheckUtils]: 197: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,480 INFO L290 TraceCheckUtils]: 196: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,480 INFO L290 TraceCheckUtils]: 195: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,480 INFO L290 TraceCheckUtils]: 194: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,480 INFO L290 TraceCheckUtils]: 193: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,481 INFO L290 TraceCheckUtils]: 192: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,481 INFO L290 TraceCheckUtils]: 191: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,481 INFO L290 TraceCheckUtils]: 190: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,481 INFO L290 TraceCheckUtils]: 189: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,482 INFO L290 TraceCheckUtils]: 188: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,482 INFO L290 TraceCheckUtils]: 187: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,482 INFO L290 TraceCheckUtils]: 186: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,482 INFO L290 TraceCheckUtils]: 185: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,483 INFO L290 TraceCheckUtils]: 184: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,483 INFO L290 TraceCheckUtils]: 183: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,483 INFO L290 TraceCheckUtils]: 182: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,483 INFO L290 TraceCheckUtils]: 181: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,483 INFO L290 TraceCheckUtils]: 180: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,484 INFO L290 TraceCheckUtils]: 179: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,484 INFO L290 TraceCheckUtils]: 178: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,484 INFO L290 TraceCheckUtils]: 177: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,484 INFO L290 TraceCheckUtils]: 176: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,485 INFO L290 TraceCheckUtils]: 175: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,485 INFO L290 TraceCheckUtils]: 174: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,485 INFO L290 TraceCheckUtils]: 173: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,485 INFO L290 TraceCheckUtils]: 172: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,486 INFO L290 TraceCheckUtils]: 171: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,486 INFO L290 TraceCheckUtils]: 170: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,486 INFO L290 TraceCheckUtils]: 169: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,486 INFO L290 TraceCheckUtils]: 168: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,487 INFO L290 TraceCheckUtils]: 167: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,487 INFO L290 TraceCheckUtils]: 166: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,487 INFO L290 TraceCheckUtils]: 165: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,487 INFO L290 TraceCheckUtils]: 164: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,488 INFO L290 TraceCheckUtils]: 163: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,488 INFO L290 TraceCheckUtils]: 162: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,488 INFO L290 TraceCheckUtils]: 161: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,488 INFO L290 TraceCheckUtils]: 160: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,488 INFO L290 TraceCheckUtils]: 159: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,489 INFO L290 TraceCheckUtils]: 158: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,489 INFO L290 TraceCheckUtils]: 157: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,489 INFO L290 TraceCheckUtils]: 156: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,489 INFO L290 TraceCheckUtils]: 155: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,490 INFO L290 TraceCheckUtils]: 154: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,490 INFO L290 TraceCheckUtils]: 153: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,490 INFO L290 TraceCheckUtils]: 152: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,490 INFO L290 TraceCheckUtils]: 151: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,491 INFO L290 TraceCheckUtils]: 150: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,491 INFO L290 TraceCheckUtils]: 149: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,491 INFO L290 TraceCheckUtils]: 148: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,491 INFO L290 TraceCheckUtils]: 147: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,491 INFO L290 TraceCheckUtils]: 146: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,492 INFO L290 TraceCheckUtils]: 145: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,492 INFO L290 TraceCheckUtils]: 144: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,492 INFO L290 TraceCheckUtils]: 143: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,492 INFO L290 TraceCheckUtils]: 142: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,493 INFO L290 TraceCheckUtils]: 141: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,493 INFO L290 TraceCheckUtils]: 140: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,493 INFO L290 TraceCheckUtils]: 139: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,493 INFO L290 TraceCheckUtils]: 138: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,494 INFO L290 TraceCheckUtils]: 137: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,494 INFO L290 TraceCheckUtils]: 136: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,494 INFO L290 TraceCheckUtils]: 135: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,494 INFO L290 TraceCheckUtils]: 134: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,495 INFO L290 TraceCheckUtils]: 133: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,495 INFO L290 TraceCheckUtils]: 132: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,495 INFO L290 TraceCheckUtils]: 131: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,495 INFO L290 TraceCheckUtils]: 130: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,495 INFO L290 TraceCheckUtils]: 129: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,496 INFO L290 TraceCheckUtils]: 128: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,496 INFO L290 TraceCheckUtils]: 127: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,496 INFO L290 TraceCheckUtils]: 126: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,496 INFO L290 TraceCheckUtils]: 125: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,497 INFO L290 TraceCheckUtils]: 124: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,497 INFO L290 TraceCheckUtils]: 123: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,497 INFO L290 TraceCheckUtils]: 122: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,497 INFO L290 TraceCheckUtils]: 121: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,498 INFO L290 TraceCheckUtils]: 120: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,498 INFO L290 TraceCheckUtils]: 119: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,498 INFO L290 TraceCheckUtils]: 118: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,498 INFO L290 TraceCheckUtils]: 117: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,499 INFO L290 TraceCheckUtils]: 116: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,499 INFO L290 TraceCheckUtils]: 115: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,499 INFO L290 TraceCheckUtils]: 114: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,499 INFO L290 TraceCheckUtils]: 113: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,499 INFO L290 TraceCheckUtils]: 112: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,500 INFO L290 TraceCheckUtils]: 111: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,500 INFO L290 TraceCheckUtils]: 110: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,500 INFO L290 TraceCheckUtils]: 109: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,500 INFO L290 TraceCheckUtils]: 108: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,501 INFO L290 TraceCheckUtils]: 107: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,501 INFO L290 TraceCheckUtils]: 106: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,501 INFO L290 TraceCheckUtils]: 105: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,501 INFO L290 TraceCheckUtils]: 104: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,502 INFO L290 TraceCheckUtils]: 103: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,502 INFO L290 TraceCheckUtils]: 102: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,502 INFO L290 TraceCheckUtils]: 101: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,502 INFO L290 TraceCheckUtils]: 100: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,502 INFO L290 TraceCheckUtils]: 99: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,503 INFO L290 TraceCheckUtils]: 98: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,503 INFO L290 TraceCheckUtils]: 97: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,503 INFO L290 TraceCheckUtils]: 96: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,503 INFO L290 TraceCheckUtils]: 95: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,504 INFO L290 TraceCheckUtils]: 94: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,504 INFO L290 TraceCheckUtils]: 93: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,504 INFO L290 TraceCheckUtils]: 92: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,504 INFO L290 TraceCheckUtils]: 91: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,505 INFO L290 TraceCheckUtils]: 90: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,505 INFO L290 TraceCheckUtils]: 89: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,505 INFO L290 TraceCheckUtils]: 88: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,505 INFO L290 TraceCheckUtils]: 87: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,506 INFO L290 TraceCheckUtils]: 86: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,506 INFO L290 TraceCheckUtils]: 85: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,506 INFO L290 TraceCheckUtils]: 84: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,506 INFO L290 TraceCheckUtils]: 83: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,506 INFO L290 TraceCheckUtils]: 82: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,507 INFO L290 TraceCheckUtils]: 81: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,507 INFO L290 TraceCheckUtils]: 80: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,507 INFO L290 TraceCheckUtils]: 79: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,507 INFO L290 TraceCheckUtils]: 78: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,508 INFO L290 TraceCheckUtils]: 77: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,508 INFO L290 TraceCheckUtils]: 76: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,508 INFO L290 TraceCheckUtils]: 75: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,508 INFO L290 TraceCheckUtils]: 74: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,509 INFO L290 TraceCheckUtils]: 71: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,509 INFO L290 TraceCheckUtils]: 69: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,510 INFO L290 TraceCheckUtils]: 68: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,510 INFO L290 TraceCheckUtils]: 67: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,510 INFO L290 TraceCheckUtils]: 66: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,510 INFO L290 TraceCheckUtils]: 65: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,511 INFO L290 TraceCheckUtils]: 64: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,512 INFO L290 TraceCheckUtils]: 60: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,512 INFO L290 TraceCheckUtils]: 59: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,512 INFO L290 TraceCheckUtils]: 58: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,512 INFO L290 TraceCheckUtils]: 57: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,512 INFO L290 TraceCheckUtils]: 56: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,513 INFO L290 TraceCheckUtils]: 55: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,513 INFO L290 TraceCheckUtils]: 54: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,513 INFO L290 TraceCheckUtils]: 53: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {41154#(< 2 main_~edgecount~0)} ~i~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {41154#(< 2 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {40040#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 09:00:52,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-08 09:00:52,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-08 09:00:52,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-08 09:00:52,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {40040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-08 09:00:52,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40040#true} is VALID [2022-04-08 09:00:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15425 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:00:52,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940462149] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:52,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:52,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-04-08 09:00:52,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:52,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [70027975] [2022-04-08 09:00:52,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [70027975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:52,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:52,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:00:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571705746] [2022-04-08 09:00:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:52,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 353 [2022-04-08 09:00:52,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:52,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:52,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:52,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:00:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:52,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:00:52,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:00:52,549 INFO L87 Difference]: Start difference. First operand 358 states and 467 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:54,231 INFO L93 Difference]: Finished difference Result 386 states and 499 transitions. [2022-04-08 09:00:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:00:54,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 353 [2022-04-08 09:00:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-08 09:00:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-08 09:00:54,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-08 09:00:54,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:54,314 INFO L225 Difference]: With dead ends: 386 [2022-04-08 09:00:54,314 INFO L226 Difference]: Without dead ends: 375 [2022-04-08 09:00:54,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:00:54,314 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 127 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:54,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 39 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-08 09:00:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 361. [2022-04-08 09:00:55,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:55,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:55,748 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:55,749 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:55,754 INFO L93 Difference]: Finished difference Result 375 states and 487 transitions. [2022-04-08 09:00:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 487 transitions. [2022-04-08 09:00:55,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:55,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:55,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 375 states. [2022-04-08 09:00:55,754 INFO L87 Difference]: Start difference. First operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 375 states. [2022-04-08 09:00:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:55,766 INFO L93 Difference]: Finished difference Result 375 states and 487 transitions. [2022-04-08 09:00:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 487 transitions. [2022-04-08 09:00:55,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:55,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:55,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:55,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:00:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 470 transitions. [2022-04-08 09:00:55,773 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 470 transitions. Word has length 353 [2022-04-08 09:00:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:55,773 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 470 transitions. [2022-04-08 09:00:55,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:55,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 470 transitions. [2022-04-08 09:00:56,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 470 transitions. [2022-04-08 09:00:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2022-04-08 09:00:56,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:56,524 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:56,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:56,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-08 09:00:56,725 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1152690534, now seen corresponding path program 57 times [2022-04-08 09:00:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:56,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [97398104] [2022-04-08 09:00:56,728 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:56,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1152690534, now seen corresponding path program 58 times [2022-04-08 09:00:56,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:56,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261029251] [2022-04-08 09:00:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:57,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {44436#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-08 09:00:57,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-08 09:00:57,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-08 09:00:57,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44436#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:57,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {44436#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-08 09:00:57,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-08 09:00:57,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-08 09:00:57,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-08 09:00:57,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {44426#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,024 INFO L290 TraceCheckUtils]: 46: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,025 INFO L290 TraceCheckUtils]: 49: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,027 INFO L290 TraceCheckUtils]: 59: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,028 INFO L290 TraceCheckUtils]: 63: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,028 INFO L290 TraceCheckUtils]: 64: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,028 INFO L290 TraceCheckUtils]: 65: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,028 INFO L290 TraceCheckUtils]: 67: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,029 INFO L290 TraceCheckUtils]: 68: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,029 INFO L290 TraceCheckUtils]: 69: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,030 INFO L290 TraceCheckUtils]: 70: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,030 INFO L290 TraceCheckUtils]: 71: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,030 INFO L290 TraceCheckUtils]: 72: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,030 INFO L290 TraceCheckUtils]: 73: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,031 INFO L290 TraceCheckUtils]: 74: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,031 INFO L290 TraceCheckUtils]: 75: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,031 INFO L290 TraceCheckUtils]: 76: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,031 INFO L290 TraceCheckUtils]: 77: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,031 INFO L290 TraceCheckUtils]: 78: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,032 INFO L290 TraceCheckUtils]: 79: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,032 INFO L290 TraceCheckUtils]: 80: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,032 INFO L290 TraceCheckUtils]: 81: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,032 INFO L290 TraceCheckUtils]: 82: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,033 INFO L290 TraceCheckUtils]: 83: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,033 INFO L290 TraceCheckUtils]: 84: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,033 INFO L290 TraceCheckUtils]: 85: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,033 INFO L290 TraceCheckUtils]: 86: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,033 INFO L290 TraceCheckUtils]: 87: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,034 INFO L290 TraceCheckUtils]: 88: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,034 INFO L290 TraceCheckUtils]: 89: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,034 INFO L290 TraceCheckUtils]: 90: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,034 INFO L290 TraceCheckUtils]: 91: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,034 INFO L290 TraceCheckUtils]: 92: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,035 INFO L290 TraceCheckUtils]: 93: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,035 INFO L290 TraceCheckUtils]: 94: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,035 INFO L290 TraceCheckUtils]: 95: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,035 INFO L290 TraceCheckUtils]: 96: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,036 INFO L290 TraceCheckUtils]: 97: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,036 INFO L290 TraceCheckUtils]: 98: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,036 INFO L290 TraceCheckUtils]: 99: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,036 INFO L290 TraceCheckUtils]: 100: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,036 INFO L290 TraceCheckUtils]: 101: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,037 INFO L290 TraceCheckUtils]: 102: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,037 INFO L290 TraceCheckUtils]: 103: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,037 INFO L290 TraceCheckUtils]: 104: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,037 INFO L290 TraceCheckUtils]: 105: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,037 INFO L290 TraceCheckUtils]: 106: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,038 INFO L290 TraceCheckUtils]: 107: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,038 INFO L290 TraceCheckUtils]: 108: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,038 INFO L290 TraceCheckUtils]: 109: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,038 INFO L290 TraceCheckUtils]: 110: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,038 INFO L290 TraceCheckUtils]: 111: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,039 INFO L290 TraceCheckUtils]: 112: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,039 INFO L290 TraceCheckUtils]: 113: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,039 INFO L290 TraceCheckUtils]: 114: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,039 INFO L290 TraceCheckUtils]: 115: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,039 INFO L290 TraceCheckUtils]: 116: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,040 INFO L290 TraceCheckUtils]: 117: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,040 INFO L290 TraceCheckUtils]: 118: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,040 INFO L290 TraceCheckUtils]: 119: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,040 INFO L290 TraceCheckUtils]: 120: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,041 INFO L290 TraceCheckUtils]: 121: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,041 INFO L290 TraceCheckUtils]: 122: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,041 INFO L290 TraceCheckUtils]: 123: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,041 INFO L290 TraceCheckUtils]: 124: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,041 INFO L290 TraceCheckUtils]: 125: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,042 INFO L290 TraceCheckUtils]: 126: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,042 INFO L290 TraceCheckUtils]: 127: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,042 INFO L290 TraceCheckUtils]: 128: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,042 INFO L290 TraceCheckUtils]: 129: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,042 INFO L290 TraceCheckUtils]: 130: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,043 INFO L290 TraceCheckUtils]: 131: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,043 INFO L290 TraceCheckUtils]: 132: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,043 INFO L290 TraceCheckUtils]: 133: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,043 INFO L290 TraceCheckUtils]: 134: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,043 INFO L290 TraceCheckUtils]: 135: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,044 INFO L290 TraceCheckUtils]: 136: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,044 INFO L290 TraceCheckUtils]: 137: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,044 INFO L290 TraceCheckUtils]: 138: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,044 INFO L290 TraceCheckUtils]: 139: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,044 INFO L290 TraceCheckUtils]: 140: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,045 INFO L290 TraceCheckUtils]: 141: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,045 INFO L290 TraceCheckUtils]: 142: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,045 INFO L290 TraceCheckUtils]: 143: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,045 INFO L290 TraceCheckUtils]: 144: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,046 INFO L290 TraceCheckUtils]: 145: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,046 INFO L290 TraceCheckUtils]: 146: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,046 INFO L290 TraceCheckUtils]: 147: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,046 INFO L290 TraceCheckUtils]: 148: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,046 INFO L290 TraceCheckUtils]: 149: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,047 INFO L290 TraceCheckUtils]: 150: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,047 INFO L290 TraceCheckUtils]: 151: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,047 INFO L290 TraceCheckUtils]: 152: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,047 INFO L290 TraceCheckUtils]: 153: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,047 INFO L290 TraceCheckUtils]: 154: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,048 INFO L290 TraceCheckUtils]: 155: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,048 INFO L290 TraceCheckUtils]: 156: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,048 INFO L290 TraceCheckUtils]: 157: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,048 INFO L290 TraceCheckUtils]: 158: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,049 INFO L290 TraceCheckUtils]: 159: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,049 INFO L290 TraceCheckUtils]: 160: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,049 INFO L290 TraceCheckUtils]: 161: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,049 INFO L290 TraceCheckUtils]: 162: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,049 INFO L290 TraceCheckUtils]: 163: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,050 INFO L290 TraceCheckUtils]: 164: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,050 INFO L290 TraceCheckUtils]: 165: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,050 INFO L290 TraceCheckUtils]: 166: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,050 INFO L290 TraceCheckUtils]: 167: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,050 INFO L290 TraceCheckUtils]: 168: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,051 INFO L290 TraceCheckUtils]: 169: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,051 INFO L290 TraceCheckUtils]: 170: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,051 INFO L290 TraceCheckUtils]: 171: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,051 INFO L290 TraceCheckUtils]: 172: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,051 INFO L290 TraceCheckUtils]: 173: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,052 INFO L290 TraceCheckUtils]: 174: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,052 INFO L290 TraceCheckUtils]: 175: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,052 INFO L290 TraceCheckUtils]: 176: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,052 INFO L290 TraceCheckUtils]: 177: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,052 INFO L290 TraceCheckUtils]: 178: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,053 INFO L290 TraceCheckUtils]: 179: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,053 INFO L290 TraceCheckUtils]: 180: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,053 INFO L290 TraceCheckUtils]: 181: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,053 INFO L290 TraceCheckUtils]: 182: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,054 INFO L290 TraceCheckUtils]: 183: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,054 INFO L290 TraceCheckUtils]: 184: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,054 INFO L290 TraceCheckUtils]: 185: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,054 INFO L290 TraceCheckUtils]: 186: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,054 INFO L290 TraceCheckUtils]: 187: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,055 INFO L290 TraceCheckUtils]: 188: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,055 INFO L290 TraceCheckUtils]: 189: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,055 INFO L290 TraceCheckUtils]: 190: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,055 INFO L290 TraceCheckUtils]: 191: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,055 INFO L290 TraceCheckUtils]: 192: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,056 INFO L290 TraceCheckUtils]: 193: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,056 INFO L290 TraceCheckUtils]: 194: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,056 INFO L290 TraceCheckUtils]: 195: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,056 INFO L290 TraceCheckUtils]: 196: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,056 INFO L290 TraceCheckUtils]: 197: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,057 INFO L290 TraceCheckUtils]: 198: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,057 INFO L290 TraceCheckUtils]: 199: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,057 INFO L290 TraceCheckUtils]: 200: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,057 INFO L290 TraceCheckUtils]: 201: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,057 INFO L290 TraceCheckUtils]: 202: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,058 INFO L290 TraceCheckUtils]: 203: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,058 INFO L290 TraceCheckUtils]: 204: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,058 INFO L290 TraceCheckUtils]: 205: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,058 INFO L290 TraceCheckUtils]: 206: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,058 INFO L290 TraceCheckUtils]: 207: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,059 INFO L290 TraceCheckUtils]: 208: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,059 INFO L290 TraceCheckUtils]: 209: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,059 INFO L290 TraceCheckUtils]: 210: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,059 INFO L290 TraceCheckUtils]: 211: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,060 INFO L290 TraceCheckUtils]: 212: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,060 INFO L290 TraceCheckUtils]: 213: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,060 INFO L290 TraceCheckUtils]: 214: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,060 INFO L290 TraceCheckUtils]: 215: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,060 INFO L290 TraceCheckUtils]: 216: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,061 INFO L290 TraceCheckUtils]: 217: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,061 INFO L290 TraceCheckUtils]: 218: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,061 INFO L290 TraceCheckUtils]: 219: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,061 INFO L290 TraceCheckUtils]: 220: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,061 INFO L290 TraceCheckUtils]: 221: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,062 INFO L290 TraceCheckUtils]: 222: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,062 INFO L290 TraceCheckUtils]: 223: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,062 INFO L290 TraceCheckUtils]: 224: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,062 INFO L290 TraceCheckUtils]: 225: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,062 INFO L290 TraceCheckUtils]: 226: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,063 INFO L290 TraceCheckUtils]: 227: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,063 INFO L290 TraceCheckUtils]: 228: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,063 INFO L290 TraceCheckUtils]: 229: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,063 INFO L290 TraceCheckUtils]: 230: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,063 INFO L290 TraceCheckUtils]: 231: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,064 INFO L290 TraceCheckUtils]: 232: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,064 INFO L290 TraceCheckUtils]: 233: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,064 INFO L290 TraceCheckUtils]: 234: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,064 INFO L290 TraceCheckUtils]: 235: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,065 INFO L290 TraceCheckUtils]: 236: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,065 INFO L290 TraceCheckUtils]: 237: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,065 INFO L290 TraceCheckUtils]: 238: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,065 INFO L290 TraceCheckUtils]: 239: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,065 INFO L290 TraceCheckUtils]: 240: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,066 INFO L290 TraceCheckUtils]: 241: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,066 INFO L290 TraceCheckUtils]: 242: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,066 INFO L290 TraceCheckUtils]: 243: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,066 INFO L290 TraceCheckUtils]: 244: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,066 INFO L290 TraceCheckUtils]: 245: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,067 INFO L290 TraceCheckUtils]: 246: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,067 INFO L290 TraceCheckUtils]: 247: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,067 INFO L290 TraceCheckUtils]: 248: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,067 INFO L290 TraceCheckUtils]: 249: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,067 INFO L290 TraceCheckUtils]: 250: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,068 INFO L290 TraceCheckUtils]: 251: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,068 INFO L290 TraceCheckUtils]: 252: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,068 INFO L290 TraceCheckUtils]: 253: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,068 INFO L290 TraceCheckUtils]: 254: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,069 INFO L290 TraceCheckUtils]: 255: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,069 INFO L290 TraceCheckUtils]: 256: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,069 INFO L290 TraceCheckUtils]: 257: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,069 INFO L290 TraceCheckUtils]: 258: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,069 INFO L290 TraceCheckUtils]: 259: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,070 INFO L290 TraceCheckUtils]: 260: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,070 INFO L290 TraceCheckUtils]: 261: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,070 INFO L290 TraceCheckUtils]: 262: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,070 INFO L290 TraceCheckUtils]: 263: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,070 INFO L290 TraceCheckUtils]: 264: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,071 INFO L290 TraceCheckUtils]: 265: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,071 INFO L290 TraceCheckUtils]: 266: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,071 INFO L290 TraceCheckUtils]: 267: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,071 INFO L290 TraceCheckUtils]: 268: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,071 INFO L290 TraceCheckUtils]: 269: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,072 INFO L290 TraceCheckUtils]: 270: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,072 INFO L290 TraceCheckUtils]: 271: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,072 INFO L290 TraceCheckUtils]: 272: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,072 INFO L290 TraceCheckUtils]: 273: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,072 INFO L290 TraceCheckUtils]: 274: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,073 INFO L290 TraceCheckUtils]: 275: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,073 INFO L290 TraceCheckUtils]: 276: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,073 INFO L290 TraceCheckUtils]: 277: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,073 INFO L290 TraceCheckUtils]: 278: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,074 INFO L290 TraceCheckUtils]: 279: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,074 INFO L290 TraceCheckUtils]: 280: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,074 INFO L290 TraceCheckUtils]: 281: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,074 INFO L290 TraceCheckUtils]: 282: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,074 INFO L290 TraceCheckUtils]: 283: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,075 INFO L290 TraceCheckUtils]: 284: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,075 INFO L290 TraceCheckUtils]: 285: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,075 INFO L290 TraceCheckUtils]: 286: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,075 INFO L290 TraceCheckUtils]: 287: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,075 INFO L290 TraceCheckUtils]: 288: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,076 INFO L290 TraceCheckUtils]: 289: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,076 INFO L290 TraceCheckUtils]: 290: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,076 INFO L290 TraceCheckUtils]: 291: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,076 INFO L290 TraceCheckUtils]: 292: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,076 INFO L290 TraceCheckUtils]: 293: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,077 INFO L290 TraceCheckUtils]: 294: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,077 INFO L290 TraceCheckUtils]: 295: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,077 INFO L290 TraceCheckUtils]: 296: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,077 INFO L290 TraceCheckUtils]: 297: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,077 INFO L290 TraceCheckUtils]: 298: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,078 INFO L290 TraceCheckUtils]: 299: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,078 INFO L290 TraceCheckUtils]: 300: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,078 INFO L290 TraceCheckUtils]: 301: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,078 INFO L290 TraceCheckUtils]: 302: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,078 INFO L290 TraceCheckUtils]: 303: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,079 INFO L290 TraceCheckUtils]: 304: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,079 INFO L290 TraceCheckUtils]: 305: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,079 INFO L290 TraceCheckUtils]: 306: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,079 INFO L290 TraceCheckUtils]: 307: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,080 INFO L290 TraceCheckUtils]: 308: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,080 INFO L290 TraceCheckUtils]: 309: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,080 INFO L290 TraceCheckUtils]: 310: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,080 INFO L290 TraceCheckUtils]: 311: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,080 INFO L290 TraceCheckUtils]: 312: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,081 INFO L290 TraceCheckUtils]: 313: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,081 INFO L290 TraceCheckUtils]: 314: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,081 INFO L290 TraceCheckUtils]: 315: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,081 INFO L290 TraceCheckUtils]: 316: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,081 INFO L290 TraceCheckUtils]: 317: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,082 INFO L290 TraceCheckUtils]: 318: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,082 INFO L290 TraceCheckUtils]: 319: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,082 INFO L290 TraceCheckUtils]: 320: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,082 INFO L290 TraceCheckUtils]: 321: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,082 INFO L290 TraceCheckUtils]: 322: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,083 INFO L290 TraceCheckUtils]: 323: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,083 INFO L290 TraceCheckUtils]: 324: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,083 INFO L290 TraceCheckUtils]: 325: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,083 INFO L290 TraceCheckUtils]: 326: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,084 INFO L290 TraceCheckUtils]: 327: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,084 INFO L290 TraceCheckUtils]: 328: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,084 INFO L290 TraceCheckUtils]: 329: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,084 INFO L290 TraceCheckUtils]: 330: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,084 INFO L290 TraceCheckUtils]: 331: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,085 INFO L290 TraceCheckUtils]: 332: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,085 INFO L290 TraceCheckUtils]: 333: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,085 INFO L290 TraceCheckUtils]: 334: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,085 INFO L290 TraceCheckUtils]: 335: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,085 INFO L290 TraceCheckUtils]: 336: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,086 INFO L290 TraceCheckUtils]: 337: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,086 INFO L290 TraceCheckUtils]: 338: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:00:57,086 INFO L290 TraceCheckUtils]: 339: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:57,087 INFO L290 TraceCheckUtils]: 340: Hoare triple {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:57,087 INFO L290 TraceCheckUtils]: 341: Hoare triple {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:57,087 INFO L290 TraceCheckUtils]: 342: Hoare triple {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:57,088 INFO L290 TraceCheckUtils]: 343: Hoare triple {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:57,088 INFO L290 TraceCheckUtils]: 344: Hoare triple {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:00:57,088 INFO L290 TraceCheckUtils]: 345: Hoare triple {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:57,089 INFO L290 TraceCheckUtils]: 346: Hoare triple {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:57,089 INFO L290 TraceCheckUtils]: 347: Hoare triple {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:57,089 INFO L290 TraceCheckUtils]: 348: Hoare triple {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {44435#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:57,090 INFO L290 TraceCheckUtils]: 349: Hoare triple {44435#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} assume !(~i~0 < ~edgecount~0); {44427#false} is VALID [2022-04-08 09:00:57,090 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-08 09:00:57,090 INFO L290 TraceCheckUtils]: 351: Hoare triple {44427#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44427#false} is VALID [2022-04-08 09:00:57,090 INFO L272 TraceCheckUtils]: 352: Hoare triple {44427#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {44427#false} is VALID [2022-04-08 09:00:57,090 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-08 09:00:57,090 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-08 09:00:57,090 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-08 09:00:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:00:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:57,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261029251] [2022-04-08 09:00:57,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261029251] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:57,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108538239] [2022-04-08 09:00:57,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:57,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:57,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:57,092 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:57,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 09:00:57,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:57,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:57,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 09:00:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:57,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:59,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44426#true} is VALID [2022-04-08 09:00:59,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {44426#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {44426#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {44426#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 09:00:59,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 09:00:59,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {44426#true} assume !(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:00:59,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {44426#true} ~i~0 := 0; {44426#true} is VALID [2022-04-08 09:00:59,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:59,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {44509#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:59,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {44509#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 09:00:59,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {44509#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:59,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {44519#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:59,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {44519#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 09:00:59,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {44519#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:59,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {44529#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:59,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {44529#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 09:00:59,020 INFO L290 TraceCheckUtils]: 32: Hoare triple {44529#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44539#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:59,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {44539#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44539#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:59,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {44539#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44539#(<= 3 main_~j~0)} is VALID [2022-04-08 09:00:59,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {44539#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44549#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:59,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {44549#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44549#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:59,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {44549#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44549#(<= 4 main_~j~0)} is VALID [2022-04-08 09:00:59,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {44549#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44559#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:59,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {44559#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44559#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:59,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {44559#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44559#(<= 5 main_~j~0)} is VALID [2022-04-08 09:00:59,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {44559#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44569#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:59,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {44569#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44569#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:59,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {44569#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44569#(<= 6 main_~j~0)} is VALID [2022-04-08 09:00:59,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {44569#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44579#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:59,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {44579#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44579#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:59,024 INFO L290 TraceCheckUtils]: 46: Hoare triple {44579#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44579#(<= 7 main_~j~0)} is VALID [2022-04-08 09:00:59,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {44579#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44589#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:59,025 INFO L290 TraceCheckUtils]: 48: Hoare triple {44589#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44589#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:59,025 INFO L290 TraceCheckUtils]: 49: Hoare triple {44589#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44589#(<= 8 main_~j~0)} is VALID [2022-04-08 09:00:59,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {44589#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44599#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:59,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {44599#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44599#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:59,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {44599#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44599#(<= 9 main_~j~0)} is VALID [2022-04-08 09:00:59,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {44599#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44609#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:59,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {44609#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44609#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:59,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {44609#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44609#(<= 10 main_~j~0)} is VALID [2022-04-08 09:00:59,027 INFO L290 TraceCheckUtils]: 56: Hoare triple {44609#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44619#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:59,027 INFO L290 TraceCheckUtils]: 57: Hoare triple {44619#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44619#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:59,027 INFO L290 TraceCheckUtils]: 58: Hoare triple {44619#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44619#(<= 11 main_~j~0)} is VALID [2022-04-08 09:00:59,028 INFO L290 TraceCheckUtils]: 59: Hoare triple {44619#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44629#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:59,028 INFO L290 TraceCheckUtils]: 60: Hoare triple {44629#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44629#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:59,028 INFO L290 TraceCheckUtils]: 61: Hoare triple {44629#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44629#(<= 12 main_~j~0)} is VALID [2022-04-08 09:00:59,028 INFO L290 TraceCheckUtils]: 62: Hoare triple {44629#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44639#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:59,029 INFO L290 TraceCheckUtils]: 63: Hoare triple {44639#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44639#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:59,029 INFO L290 TraceCheckUtils]: 64: Hoare triple {44639#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44639#(<= 13 main_~j~0)} is VALID [2022-04-08 09:00:59,029 INFO L290 TraceCheckUtils]: 65: Hoare triple {44639#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44649#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:59,029 INFO L290 TraceCheckUtils]: 66: Hoare triple {44649#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44649#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:59,030 INFO L290 TraceCheckUtils]: 67: Hoare triple {44649#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44649#(<= 14 main_~j~0)} is VALID [2022-04-08 09:00:59,030 INFO L290 TraceCheckUtils]: 68: Hoare triple {44649#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44659#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:59,030 INFO L290 TraceCheckUtils]: 69: Hoare triple {44659#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44659#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:59,031 INFO L290 TraceCheckUtils]: 70: Hoare triple {44659#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44659#(<= 15 main_~j~0)} is VALID [2022-04-08 09:00:59,031 INFO L290 TraceCheckUtils]: 71: Hoare triple {44659#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44669#(<= 16 main_~j~0)} is VALID [2022-04-08 09:00:59,031 INFO L290 TraceCheckUtils]: 72: Hoare triple {44669#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44669#(<= 16 main_~j~0)} is VALID [2022-04-08 09:00:59,031 INFO L290 TraceCheckUtils]: 73: Hoare triple {44669#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44669#(<= 16 main_~j~0)} is VALID [2022-04-08 09:00:59,032 INFO L290 TraceCheckUtils]: 74: Hoare triple {44669#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44679#(<= 17 main_~j~0)} is VALID [2022-04-08 09:00:59,032 INFO L290 TraceCheckUtils]: 75: Hoare triple {44679#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44679#(<= 17 main_~j~0)} is VALID [2022-04-08 09:00:59,032 INFO L290 TraceCheckUtils]: 76: Hoare triple {44679#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44679#(<= 17 main_~j~0)} is VALID [2022-04-08 09:00:59,033 INFO L290 TraceCheckUtils]: 77: Hoare triple {44679#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44689#(<= 18 main_~j~0)} is VALID [2022-04-08 09:00:59,033 INFO L290 TraceCheckUtils]: 78: Hoare triple {44689#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44689#(<= 18 main_~j~0)} is VALID [2022-04-08 09:00:59,033 INFO L290 TraceCheckUtils]: 79: Hoare triple {44689#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44689#(<= 18 main_~j~0)} is VALID [2022-04-08 09:00:59,033 INFO L290 TraceCheckUtils]: 80: Hoare triple {44689#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44699#(<= 19 main_~j~0)} is VALID [2022-04-08 09:00:59,034 INFO L290 TraceCheckUtils]: 81: Hoare triple {44699#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,034 INFO L290 TraceCheckUtils]: 82: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,034 INFO L290 TraceCheckUtils]: 83: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,035 INFO L290 TraceCheckUtils]: 84: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,035 INFO L290 TraceCheckUtils]: 85: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,035 INFO L290 TraceCheckUtils]: 86: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,035 INFO L290 TraceCheckUtils]: 87: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,036 INFO L290 TraceCheckUtils]: 88: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,036 INFO L290 TraceCheckUtils]: 89: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,036 INFO L290 TraceCheckUtils]: 90: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,036 INFO L290 TraceCheckUtils]: 91: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,036 INFO L290 TraceCheckUtils]: 92: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,037 INFO L290 TraceCheckUtils]: 93: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,037 INFO L290 TraceCheckUtils]: 94: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,037 INFO L290 TraceCheckUtils]: 95: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,037 INFO L290 TraceCheckUtils]: 96: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,038 INFO L290 TraceCheckUtils]: 97: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,038 INFO L290 TraceCheckUtils]: 98: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,038 INFO L290 TraceCheckUtils]: 99: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,038 INFO L290 TraceCheckUtils]: 100: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,039 INFO L290 TraceCheckUtils]: 101: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,039 INFO L290 TraceCheckUtils]: 102: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,039 INFO L290 TraceCheckUtils]: 103: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,039 INFO L290 TraceCheckUtils]: 104: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,039 INFO L290 TraceCheckUtils]: 105: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,040 INFO L290 TraceCheckUtils]: 106: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,040 INFO L290 TraceCheckUtils]: 107: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,040 INFO L290 TraceCheckUtils]: 108: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,040 INFO L290 TraceCheckUtils]: 109: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,041 INFO L290 TraceCheckUtils]: 110: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,041 INFO L290 TraceCheckUtils]: 111: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,041 INFO L290 TraceCheckUtils]: 112: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,041 INFO L290 TraceCheckUtils]: 113: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,042 INFO L290 TraceCheckUtils]: 114: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,042 INFO L290 TraceCheckUtils]: 115: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,042 INFO L290 TraceCheckUtils]: 116: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,042 INFO L290 TraceCheckUtils]: 117: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,042 INFO L290 TraceCheckUtils]: 118: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,043 INFO L290 TraceCheckUtils]: 119: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,043 INFO L290 TraceCheckUtils]: 120: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,043 INFO L290 TraceCheckUtils]: 121: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,043 INFO L290 TraceCheckUtils]: 122: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,044 INFO L290 TraceCheckUtils]: 123: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,044 INFO L290 TraceCheckUtils]: 124: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,044 INFO L290 TraceCheckUtils]: 125: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,044 INFO L290 TraceCheckUtils]: 126: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,045 INFO L290 TraceCheckUtils]: 127: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,045 INFO L290 TraceCheckUtils]: 128: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,045 INFO L290 TraceCheckUtils]: 129: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,045 INFO L290 TraceCheckUtils]: 130: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,045 INFO L290 TraceCheckUtils]: 131: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,046 INFO L290 TraceCheckUtils]: 132: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,046 INFO L290 TraceCheckUtils]: 133: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,046 INFO L290 TraceCheckUtils]: 134: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,046 INFO L290 TraceCheckUtils]: 135: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,047 INFO L290 TraceCheckUtils]: 136: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,047 INFO L290 TraceCheckUtils]: 137: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,047 INFO L290 TraceCheckUtils]: 138: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,047 INFO L290 TraceCheckUtils]: 139: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,048 INFO L290 TraceCheckUtils]: 140: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,048 INFO L290 TraceCheckUtils]: 141: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,048 INFO L290 TraceCheckUtils]: 142: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,048 INFO L290 TraceCheckUtils]: 143: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,048 INFO L290 TraceCheckUtils]: 144: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,049 INFO L290 TraceCheckUtils]: 145: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,049 INFO L290 TraceCheckUtils]: 146: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,049 INFO L290 TraceCheckUtils]: 147: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,049 INFO L290 TraceCheckUtils]: 148: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,050 INFO L290 TraceCheckUtils]: 149: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,050 INFO L290 TraceCheckUtils]: 150: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,050 INFO L290 TraceCheckUtils]: 151: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,050 INFO L290 TraceCheckUtils]: 152: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,051 INFO L290 TraceCheckUtils]: 153: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,051 INFO L290 TraceCheckUtils]: 154: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,051 INFO L290 TraceCheckUtils]: 155: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,051 INFO L290 TraceCheckUtils]: 156: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,051 INFO L290 TraceCheckUtils]: 157: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,052 INFO L290 TraceCheckUtils]: 158: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,052 INFO L290 TraceCheckUtils]: 159: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,052 INFO L290 TraceCheckUtils]: 160: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,052 INFO L290 TraceCheckUtils]: 161: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,053 INFO L290 TraceCheckUtils]: 162: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,053 INFO L290 TraceCheckUtils]: 163: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,053 INFO L290 TraceCheckUtils]: 164: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,053 INFO L290 TraceCheckUtils]: 165: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,054 INFO L290 TraceCheckUtils]: 166: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,054 INFO L290 TraceCheckUtils]: 167: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,054 INFO L290 TraceCheckUtils]: 168: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,054 INFO L290 TraceCheckUtils]: 169: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,054 INFO L290 TraceCheckUtils]: 170: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,055 INFO L290 TraceCheckUtils]: 171: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,055 INFO L290 TraceCheckUtils]: 172: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,055 INFO L290 TraceCheckUtils]: 173: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,055 INFO L290 TraceCheckUtils]: 174: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,056 INFO L290 TraceCheckUtils]: 175: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,056 INFO L290 TraceCheckUtils]: 176: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,056 INFO L290 TraceCheckUtils]: 177: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,056 INFO L290 TraceCheckUtils]: 178: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,057 INFO L290 TraceCheckUtils]: 179: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,057 INFO L290 TraceCheckUtils]: 180: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,057 INFO L290 TraceCheckUtils]: 181: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,057 INFO L290 TraceCheckUtils]: 182: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,058 INFO L290 TraceCheckUtils]: 183: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,058 INFO L290 TraceCheckUtils]: 184: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,058 INFO L290 TraceCheckUtils]: 185: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,058 INFO L290 TraceCheckUtils]: 186: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,058 INFO L290 TraceCheckUtils]: 187: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,059 INFO L290 TraceCheckUtils]: 188: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,059 INFO L290 TraceCheckUtils]: 189: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,059 INFO L290 TraceCheckUtils]: 190: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,059 INFO L290 TraceCheckUtils]: 191: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,060 INFO L290 TraceCheckUtils]: 192: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,060 INFO L290 TraceCheckUtils]: 193: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,060 INFO L290 TraceCheckUtils]: 194: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,060 INFO L290 TraceCheckUtils]: 195: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,061 INFO L290 TraceCheckUtils]: 196: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,061 INFO L290 TraceCheckUtils]: 197: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,061 INFO L290 TraceCheckUtils]: 198: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,061 INFO L290 TraceCheckUtils]: 199: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,061 INFO L290 TraceCheckUtils]: 200: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,062 INFO L290 TraceCheckUtils]: 201: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,062 INFO L290 TraceCheckUtils]: 202: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,062 INFO L290 TraceCheckUtils]: 203: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,062 INFO L290 TraceCheckUtils]: 204: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,063 INFO L290 TraceCheckUtils]: 205: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,063 INFO L290 TraceCheckUtils]: 206: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,063 INFO L290 TraceCheckUtils]: 207: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,063 INFO L290 TraceCheckUtils]: 208: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,064 INFO L290 TraceCheckUtils]: 209: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,064 INFO L290 TraceCheckUtils]: 210: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,064 INFO L290 TraceCheckUtils]: 211: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,064 INFO L290 TraceCheckUtils]: 212: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,065 INFO L290 TraceCheckUtils]: 213: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,065 INFO L290 TraceCheckUtils]: 214: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,065 INFO L290 TraceCheckUtils]: 215: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,065 INFO L290 TraceCheckUtils]: 216: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,065 INFO L290 TraceCheckUtils]: 217: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,066 INFO L290 TraceCheckUtils]: 218: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,066 INFO L290 TraceCheckUtils]: 219: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,066 INFO L290 TraceCheckUtils]: 220: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,066 INFO L290 TraceCheckUtils]: 221: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,067 INFO L290 TraceCheckUtils]: 222: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,067 INFO L290 TraceCheckUtils]: 223: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,067 INFO L290 TraceCheckUtils]: 224: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,067 INFO L290 TraceCheckUtils]: 225: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,068 INFO L290 TraceCheckUtils]: 226: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,068 INFO L290 TraceCheckUtils]: 227: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,068 INFO L290 TraceCheckUtils]: 228: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,068 INFO L290 TraceCheckUtils]: 229: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,069 INFO L290 TraceCheckUtils]: 230: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,069 INFO L290 TraceCheckUtils]: 231: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,069 INFO L290 TraceCheckUtils]: 232: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,069 INFO L290 TraceCheckUtils]: 233: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,069 INFO L290 TraceCheckUtils]: 234: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,070 INFO L290 TraceCheckUtils]: 235: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,070 INFO L290 TraceCheckUtils]: 236: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,070 INFO L290 TraceCheckUtils]: 237: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,070 INFO L290 TraceCheckUtils]: 238: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,071 INFO L290 TraceCheckUtils]: 239: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,071 INFO L290 TraceCheckUtils]: 240: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,071 INFO L290 TraceCheckUtils]: 241: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,071 INFO L290 TraceCheckUtils]: 242: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,072 INFO L290 TraceCheckUtils]: 243: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,072 INFO L290 TraceCheckUtils]: 244: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,072 INFO L290 TraceCheckUtils]: 245: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,072 INFO L290 TraceCheckUtils]: 246: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,073 INFO L290 TraceCheckUtils]: 247: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,073 INFO L290 TraceCheckUtils]: 248: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,073 INFO L290 TraceCheckUtils]: 249: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,073 INFO L290 TraceCheckUtils]: 250: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,073 INFO L290 TraceCheckUtils]: 251: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,074 INFO L290 TraceCheckUtils]: 252: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,074 INFO L290 TraceCheckUtils]: 253: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,074 INFO L290 TraceCheckUtils]: 254: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,074 INFO L290 TraceCheckUtils]: 255: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,075 INFO L290 TraceCheckUtils]: 256: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,075 INFO L290 TraceCheckUtils]: 257: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,075 INFO L290 TraceCheckUtils]: 258: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,075 INFO L290 TraceCheckUtils]: 259: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,076 INFO L290 TraceCheckUtils]: 260: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,076 INFO L290 TraceCheckUtils]: 261: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,076 INFO L290 TraceCheckUtils]: 262: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,076 INFO L290 TraceCheckUtils]: 263: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,077 INFO L290 TraceCheckUtils]: 264: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,077 INFO L290 TraceCheckUtils]: 265: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,077 INFO L290 TraceCheckUtils]: 266: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,077 INFO L290 TraceCheckUtils]: 267: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,077 INFO L290 TraceCheckUtils]: 268: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,078 INFO L290 TraceCheckUtils]: 269: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,078 INFO L290 TraceCheckUtils]: 270: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,078 INFO L290 TraceCheckUtils]: 271: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,078 INFO L290 TraceCheckUtils]: 272: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,079 INFO L290 TraceCheckUtils]: 273: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,079 INFO L290 TraceCheckUtils]: 274: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,079 INFO L290 TraceCheckUtils]: 275: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,079 INFO L290 TraceCheckUtils]: 276: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,080 INFO L290 TraceCheckUtils]: 277: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,080 INFO L290 TraceCheckUtils]: 278: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,080 INFO L290 TraceCheckUtils]: 279: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,080 INFO L290 TraceCheckUtils]: 280: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,081 INFO L290 TraceCheckUtils]: 281: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,081 INFO L290 TraceCheckUtils]: 282: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,081 INFO L290 TraceCheckUtils]: 283: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,081 INFO L290 TraceCheckUtils]: 284: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,081 INFO L290 TraceCheckUtils]: 285: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,082 INFO L290 TraceCheckUtils]: 286: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,082 INFO L290 TraceCheckUtils]: 287: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,082 INFO L290 TraceCheckUtils]: 288: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,082 INFO L290 TraceCheckUtils]: 289: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,083 INFO L290 TraceCheckUtils]: 290: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,083 INFO L290 TraceCheckUtils]: 291: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,083 INFO L290 TraceCheckUtils]: 292: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,083 INFO L290 TraceCheckUtils]: 293: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,084 INFO L290 TraceCheckUtils]: 294: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,084 INFO L290 TraceCheckUtils]: 295: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,084 INFO L290 TraceCheckUtils]: 296: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,084 INFO L290 TraceCheckUtils]: 297: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,084 INFO L290 TraceCheckUtils]: 298: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,085 INFO L290 TraceCheckUtils]: 299: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,085 INFO L290 TraceCheckUtils]: 300: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,085 INFO L290 TraceCheckUtils]: 301: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,085 INFO L290 TraceCheckUtils]: 302: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,086 INFO L290 TraceCheckUtils]: 303: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,086 INFO L290 TraceCheckUtils]: 304: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,086 INFO L290 TraceCheckUtils]: 305: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,086 INFO L290 TraceCheckUtils]: 306: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,087 INFO L290 TraceCheckUtils]: 307: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,087 INFO L290 TraceCheckUtils]: 308: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,087 INFO L290 TraceCheckUtils]: 309: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,087 INFO L290 TraceCheckUtils]: 310: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,087 INFO L290 TraceCheckUtils]: 311: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,088 INFO L290 TraceCheckUtils]: 312: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,088 INFO L290 TraceCheckUtils]: 313: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,088 INFO L290 TraceCheckUtils]: 314: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,088 INFO L290 TraceCheckUtils]: 315: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,089 INFO L290 TraceCheckUtils]: 316: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,089 INFO L290 TraceCheckUtils]: 317: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,089 INFO L290 TraceCheckUtils]: 318: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,089 INFO L290 TraceCheckUtils]: 319: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,090 INFO L290 TraceCheckUtils]: 320: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,090 INFO L290 TraceCheckUtils]: 321: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,090 INFO L290 TraceCheckUtils]: 322: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,090 INFO L290 TraceCheckUtils]: 323: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,091 INFO L290 TraceCheckUtils]: 324: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,091 INFO L290 TraceCheckUtils]: 325: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,091 INFO L290 TraceCheckUtils]: 326: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,091 INFO L290 TraceCheckUtils]: 327: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,092 INFO L290 TraceCheckUtils]: 328: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,092 INFO L290 TraceCheckUtils]: 329: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,092 INFO L290 TraceCheckUtils]: 330: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,092 INFO L290 TraceCheckUtils]: 331: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,092 INFO L290 TraceCheckUtils]: 332: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,093 INFO L290 TraceCheckUtils]: 333: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,093 INFO L290 TraceCheckUtils]: 334: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,093 INFO L290 TraceCheckUtils]: 335: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,093 INFO L290 TraceCheckUtils]: 336: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,094 INFO L290 TraceCheckUtils]: 337: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,094 INFO L290 TraceCheckUtils]: 338: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:00:59,094 INFO L290 TraceCheckUtils]: 339: Hoare triple {44703#(< 19 main_~edgecount~0)} ~i~0 := 0; {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:00:59,095 INFO L290 TraceCheckUtils]: 340: Hoare triple {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:00:59,095 INFO L290 TraceCheckUtils]: 341: Hoare triple {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:00:59,095 INFO L290 TraceCheckUtils]: 342: Hoare triple {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:00:59,096 INFO L290 TraceCheckUtils]: 343: Hoare triple {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:00:59,096 INFO L290 TraceCheckUtils]: 344: Hoare triple {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:00:59,096 INFO L290 TraceCheckUtils]: 345: Hoare triple {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:59,097 INFO L290 TraceCheckUtils]: 346: Hoare triple {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:59,097 INFO L290 TraceCheckUtils]: 347: Hoare triple {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:00:59,098 INFO L290 TraceCheckUtils]: 348: Hoare triple {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45508#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:59,098 INFO L290 TraceCheckUtils]: 349: Hoare triple {45508#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} assume !(~i~0 < ~edgecount~0); {44427#false} is VALID [2022-04-08 09:00:59,098 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-08 09:00:59,098 INFO L290 TraceCheckUtils]: 351: Hoare triple {44427#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44427#false} is VALID [2022-04-08 09:00:59,098 INFO L272 TraceCheckUtils]: 352: Hoare triple {44427#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {44427#false} is VALID [2022-04-08 09:00:59,098 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-08 09:00:59,098 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-08 09:00:59,098 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-08 09:00:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 537 proven. 4790 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-08 09:00:59,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:00,439 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-08 09:01:00,439 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-08 09:01:00,439 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-08 09:01:00,439 INFO L272 TraceCheckUtils]: 352: Hoare triple {44427#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {44427#false} is VALID [2022-04-08 09:01:00,440 INFO L290 TraceCheckUtils]: 351: Hoare triple {44427#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44427#false} is VALID [2022-04-08 09:01:00,440 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-08 09:01:00,440 INFO L290 TraceCheckUtils]: 349: Hoare triple {45548#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {44427#false} is VALID [2022-04-08 09:01:00,440 INFO L290 TraceCheckUtils]: 348: Hoare triple {45552#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45548#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,440 INFO L290 TraceCheckUtils]: 347: Hoare triple {45552#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45552#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:00,441 INFO L290 TraceCheckUtils]: 346: Hoare triple {45552#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45552#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:00,441 INFO L290 TraceCheckUtils]: 345: Hoare triple {45562#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45552#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:00,441 INFO L290 TraceCheckUtils]: 344: Hoare triple {45562#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45562#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:00,442 INFO L290 TraceCheckUtils]: 343: Hoare triple {45562#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45562#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:00,442 INFO L290 TraceCheckUtils]: 342: Hoare triple {45572#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45562#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:00,442 INFO L290 TraceCheckUtils]: 341: Hoare triple {45572#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45572#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:00,442 INFO L290 TraceCheckUtils]: 340: Hoare triple {45572#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45572#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:00,443 INFO L290 TraceCheckUtils]: 339: Hoare triple {45582#(< 3 main_~edgecount~0)} ~i~0 := 0; {45572#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:00,443 INFO L290 TraceCheckUtils]: 338: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,443 INFO L290 TraceCheckUtils]: 337: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,443 INFO L290 TraceCheckUtils]: 336: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,444 INFO L290 TraceCheckUtils]: 335: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,444 INFO L290 TraceCheckUtils]: 334: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,444 INFO L290 TraceCheckUtils]: 333: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,444 INFO L290 TraceCheckUtils]: 332: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,445 INFO L290 TraceCheckUtils]: 331: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,445 INFO L290 TraceCheckUtils]: 330: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,445 INFO L290 TraceCheckUtils]: 329: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,445 INFO L290 TraceCheckUtils]: 328: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,446 INFO L290 TraceCheckUtils]: 327: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,446 INFO L290 TraceCheckUtils]: 326: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,446 INFO L290 TraceCheckUtils]: 325: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,446 INFO L290 TraceCheckUtils]: 324: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,447 INFO L290 TraceCheckUtils]: 323: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,447 INFO L290 TraceCheckUtils]: 322: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,447 INFO L290 TraceCheckUtils]: 321: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,447 INFO L290 TraceCheckUtils]: 320: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,447 INFO L290 TraceCheckUtils]: 319: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,448 INFO L290 TraceCheckUtils]: 318: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,448 INFO L290 TraceCheckUtils]: 317: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,448 INFO L290 TraceCheckUtils]: 316: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,448 INFO L290 TraceCheckUtils]: 315: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,449 INFO L290 TraceCheckUtils]: 314: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,449 INFO L290 TraceCheckUtils]: 313: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,449 INFO L290 TraceCheckUtils]: 312: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,449 INFO L290 TraceCheckUtils]: 311: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,450 INFO L290 TraceCheckUtils]: 310: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,450 INFO L290 TraceCheckUtils]: 309: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,450 INFO L290 TraceCheckUtils]: 308: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,450 INFO L290 TraceCheckUtils]: 307: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,450 INFO L290 TraceCheckUtils]: 306: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,451 INFO L290 TraceCheckUtils]: 305: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,451 INFO L290 TraceCheckUtils]: 304: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,451 INFO L290 TraceCheckUtils]: 303: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,451 INFO L290 TraceCheckUtils]: 302: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,452 INFO L290 TraceCheckUtils]: 301: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,452 INFO L290 TraceCheckUtils]: 300: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,452 INFO L290 TraceCheckUtils]: 299: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,452 INFO L290 TraceCheckUtils]: 298: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,453 INFO L290 TraceCheckUtils]: 297: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,453 INFO L290 TraceCheckUtils]: 296: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,453 INFO L290 TraceCheckUtils]: 295: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,453 INFO L290 TraceCheckUtils]: 294: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,454 INFO L290 TraceCheckUtils]: 293: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,454 INFO L290 TraceCheckUtils]: 292: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,454 INFO L290 TraceCheckUtils]: 291: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,454 INFO L290 TraceCheckUtils]: 290: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,454 INFO L290 TraceCheckUtils]: 289: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,455 INFO L290 TraceCheckUtils]: 288: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,455 INFO L290 TraceCheckUtils]: 287: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,455 INFO L290 TraceCheckUtils]: 286: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,455 INFO L290 TraceCheckUtils]: 285: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,456 INFO L290 TraceCheckUtils]: 284: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,456 INFO L290 TraceCheckUtils]: 283: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,456 INFO L290 TraceCheckUtils]: 282: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,456 INFO L290 TraceCheckUtils]: 281: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,457 INFO L290 TraceCheckUtils]: 280: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,457 INFO L290 TraceCheckUtils]: 279: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,457 INFO L290 TraceCheckUtils]: 278: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,457 INFO L290 TraceCheckUtils]: 277: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,458 INFO L290 TraceCheckUtils]: 276: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,458 INFO L290 TraceCheckUtils]: 275: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,458 INFO L290 TraceCheckUtils]: 274: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,458 INFO L290 TraceCheckUtils]: 273: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,458 INFO L290 TraceCheckUtils]: 272: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,459 INFO L290 TraceCheckUtils]: 271: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,459 INFO L290 TraceCheckUtils]: 270: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,459 INFO L290 TraceCheckUtils]: 269: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,459 INFO L290 TraceCheckUtils]: 268: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,460 INFO L290 TraceCheckUtils]: 267: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,460 INFO L290 TraceCheckUtils]: 266: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,460 INFO L290 TraceCheckUtils]: 265: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,460 INFO L290 TraceCheckUtils]: 264: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,461 INFO L290 TraceCheckUtils]: 263: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,461 INFO L290 TraceCheckUtils]: 262: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,461 INFO L290 TraceCheckUtils]: 261: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,461 INFO L290 TraceCheckUtils]: 260: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,462 INFO L290 TraceCheckUtils]: 259: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,462 INFO L290 TraceCheckUtils]: 258: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,462 INFO L290 TraceCheckUtils]: 257: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,462 INFO L290 TraceCheckUtils]: 256: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,462 INFO L290 TraceCheckUtils]: 255: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,463 INFO L290 TraceCheckUtils]: 254: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,463 INFO L290 TraceCheckUtils]: 253: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,463 INFO L290 TraceCheckUtils]: 252: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,463 INFO L290 TraceCheckUtils]: 251: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,464 INFO L290 TraceCheckUtils]: 250: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,464 INFO L290 TraceCheckUtils]: 249: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,464 INFO L290 TraceCheckUtils]: 248: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,464 INFO L290 TraceCheckUtils]: 247: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,465 INFO L290 TraceCheckUtils]: 246: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,465 INFO L290 TraceCheckUtils]: 245: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,465 INFO L290 TraceCheckUtils]: 244: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,465 INFO L290 TraceCheckUtils]: 243: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,465 INFO L290 TraceCheckUtils]: 242: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,466 INFO L290 TraceCheckUtils]: 241: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,466 INFO L290 TraceCheckUtils]: 240: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,466 INFO L290 TraceCheckUtils]: 239: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,466 INFO L290 TraceCheckUtils]: 238: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,467 INFO L290 TraceCheckUtils]: 237: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,467 INFO L290 TraceCheckUtils]: 236: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,467 INFO L290 TraceCheckUtils]: 235: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,467 INFO L290 TraceCheckUtils]: 234: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,468 INFO L290 TraceCheckUtils]: 233: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,468 INFO L290 TraceCheckUtils]: 232: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,468 INFO L290 TraceCheckUtils]: 231: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,468 INFO L290 TraceCheckUtils]: 230: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,469 INFO L290 TraceCheckUtils]: 229: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,469 INFO L290 TraceCheckUtils]: 228: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,469 INFO L290 TraceCheckUtils]: 227: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,469 INFO L290 TraceCheckUtils]: 226: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,470 INFO L290 TraceCheckUtils]: 225: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,470 INFO L290 TraceCheckUtils]: 224: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,470 INFO L290 TraceCheckUtils]: 223: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,470 INFO L290 TraceCheckUtils]: 222: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,470 INFO L290 TraceCheckUtils]: 221: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,471 INFO L290 TraceCheckUtils]: 220: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,471 INFO L290 TraceCheckUtils]: 219: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,471 INFO L290 TraceCheckUtils]: 218: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,471 INFO L290 TraceCheckUtils]: 217: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,472 INFO L290 TraceCheckUtils]: 216: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,472 INFO L290 TraceCheckUtils]: 215: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,472 INFO L290 TraceCheckUtils]: 214: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,472 INFO L290 TraceCheckUtils]: 213: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,473 INFO L290 TraceCheckUtils]: 212: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,473 INFO L290 TraceCheckUtils]: 211: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,473 INFO L290 TraceCheckUtils]: 210: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,473 INFO L290 TraceCheckUtils]: 209: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,474 INFO L290 TraceCheckUtils]: 208: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,474 INFO L290 TraceCheckUtils]: 207: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,474 INFO L290 TraceCheckUtils]: 206: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,474 INFO L290 TraceCheckUtils]: 205: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,474 INFO L290 TraceCheckUtils]: 204: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,475 INFO L290 TraceCheckUtils]: 203: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,475 INFO L290 TraceCheckUtils]: 202: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,475 INFO L290 TraceCheckUtils]: 201: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,475 INFO L290 TraceCheckUtils]: 200: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,476 INFO L290 TraceCheckUtils]: 199: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,476 INFO L290 TraceCheckUtils]: 198: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,476 INFO L290 TraceCheckUtils]: 197: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,476 INFO L290 TraceCheckUtils]: 196: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,477 INFO L290 TraceCheckUtils]: 195: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,477 INFO L290 TraceCheckUtils]: 194: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,477 INFO L290 TraceCheckUtils]: 193: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,477 INFO L290 TraceCheckUtils]: 192: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,478 INFO L290 TraceCheckUtils]: 191: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,478 INFO L290 TraceCheckUtils]: 190: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,478 INFO L290 TraceCheckUtils]: 189: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,478 INFO L290 TraceCheckUtils]: 188: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,478 INFO L290 TraceCheckUtils]: 187: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,479 INFO L290 TraceCheckUtils]: 186: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,479 INFO L290 TraceCheckUtils]: 185: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,479 INFO L290 TraceCheckUtils]: 184: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,479 INFO L290 TraceCheckUtils]: 183: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,480 INFO L290 TraceCheckUtils]: 182: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,480 INFO L290 TraceCheckUtils]: 181: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,480 INFO L290 TraceCheckUtils]: 180: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,480 INFO L290 TraceCheckUtils]: 179: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,481 INFO L290 TraceCheckUtils]: 178: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,481 INFO L290 TraceCheckUtils]: 177: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,481 INFO L290 TraceCheckUtils]: 176: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,481 INFO L290 TraceCheckUtils]: 175: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,481 INFO L290 TraceCheckUtils]: 174: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,482 INFO L290 TraceCheckUtils]: 173: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,482 INFO L290 TraceCheckUtils]: 172: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,482 INFO L290 TraceCheckUtils]: 171: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,482 INFO L290 TraceCheckUtils]: 170: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,483 INFO L290 TraceCheckUtils]: 169: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,483 INFO L290 TraceCheckUtils]: 168: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,483 INFO L290 TraceCheckUtils]: 167: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,483 INFO L290 TraceCheckUtils]: 166: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,484 INFO L290 TraceCheckUtils]: 165: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,484 INFO L290 TraceCheckUtils]: 164: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,484 INFO L290 TraceCheckUtils]: 163: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,484 INFO L290 TraceCheckUtils]: 162: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,485 INFO L290 TraceCheckUtils]: 161: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,485 INFO L290 TraceCheckUtils]: 160: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,485 INFO L290 TraceCheckUtils]: 159: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,485 INFO L290 TraceCheckUtils]: 158: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,485 INFO L290 TraceCheckUtils]: 157: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,486 INFO L290 TraceCheckUtils]: 156: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,486 INFO L290 TraceCheckUtils]: 155: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,486 INFO L290 TraceCheckUtils]: 154: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,486 INFO L290 TraceCheckUtils]: 153: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,487 INFO L290 TraceCheckUtils]: 152: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,487 INFO L290 TraceCheckUtils]: 151: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,487 INFO L290 TraceCheckUtils]: 150: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,487 INFO L290 TraceCheckUtils]: 149: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,488 INFO L290 TraceCheckUtils]: 148: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,488 INFO L290 TraceCheckUtils]: 147: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,488 INFO L290 TraceCheckUtils]: 146: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,488 INFO L290 TraceCheckUtils]: 145: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,488 INFO L290 TraceCheckUtils]: 144: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,489 INFO L290 TraceCheckUtils]: 143: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,489 INFO L290 TraceCheckUtils]: 142: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,489 INFO L290 TraceCheckUtils]: 141: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,489 INFO L290 TraceCheckUtils]: 140: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,490 INFO L290 TraceCheckUtils]: 139: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,490 INFO L290 TraceCheckUtils]: 138: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,490 INFO L290 TraceCheckUtils]: 137: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,490 INFO L290 TraceCheckUtils]: 136: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,491 INFO L290 TraceCheckUtils]: 135: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,491 INFO L290 TraceCheckUtils]: 134: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,491 INFO L290 TraceCheckUtils]: 133: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,491 INFO L290 TraceCheckUtils]: 132: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,492 INFO L290 TraceCheckUtils]: 131: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,492 INFO L290 TraceCheckUtils]: 130: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,492 INFO L290 TraceCheckUtils]: 129: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,492 INFO L290 TraceCheckUtils]: 128: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,492 INFO L290 TraceCheckUtils]: 127: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,493 INFO L290 TraceCheckUtils]: 126: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,493 INFO L290 TraceCheckUtils]: 125: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,493 INFO L290 TraceCheckUtils]: 124: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,493 INFO L290 TraceCheckUtils]: 123: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,494 INFO L290 TraceCheckUtils]: 122: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,494 INFO L290 TraceCheckUtils]: 121: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,494 INFO L290 TraceCheckUtils]: 120: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,494 INFO L290 TraceCheckUtils]: 119: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,495 INFO L290 TraceCheckUtils]: 118: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,495 INFO L290 TraceCheckUtils]: 117: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,495 INFO L290 TraceCheckUtils]: 116: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,495 INFO L290 TraceCheckUtils]: 115: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,495 INFO L290 TraceCheckUtils]: 114: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,496 INFO L290 TraceCheckUtils]: 113: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,496 INFO L290 TraceCheckUtils]: 112: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,496 INFO L290 TraceCheckUtils]: 111: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,496 INFO L290 TraceCheckUtils]: 110: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,497 INFO L290 TraceCheckUtils]: 109: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,497 INFO L290 TraceCheckUtils]: 108: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,497 INFO L290 TraceCheckUtils]: 107: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,497 INFO L290 TraceCheckUtils]: 106: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,498 INFO L290 TraceCheckUtils]: 105: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,498 INFO L290 TraceCheckUtils]: 104: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,498 INFO L290 TraceCheckUtils]: 103: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,498 INFO L290 TraceCheckUtils]: 102: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,499 INFO L290 TraceCheckUtils]: 101: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,499 INFO L290 TraceCheckUtils]: 100: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,499 INFO L290 TraceCheckUtils]: 99: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,499 INFO L290 TraceCheckUtils]: 98: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,499 INFO L290 TraceCheckUtils]: 97: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,500 INFO L290 TraceCheckUtils]: 96: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,500 INFO L290 TraceCheckUtils]: 95: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,500 INFO L290 TraceCheckUtils]: 94: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,500 INFO L290 TraceCheckUtils]: 93: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,501 INFO L290 TraceCheckUtils]: 92: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,501 INFO L290 TraceCheckUtils]: 91: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,501 INFO L290 TraceCheckUtils]: 90: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,501 INFO L290 TraceCheckUtils]: 89: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,502 INFO L290 TraceCheckUtils]: 87: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,502 INFO L290 TraceCheckUtils]: 86: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,502 INFO L290 TraceCheckUtils]: 84: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,503 INFO L290 TraceCheckUtils]: 83: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,503 INFO L290 TraceCheckUtils]: 82: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,503 INFO L290 TraceCheckUtils]: 81: Hoare triple {44539#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 09:01:00,504 INFO L290 TraceCheckUtils]: 80: Hoare triple {44529#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44539#(<= 3 main_~j~0)} is VALID [2022-04-08 09:01:00,504 INFO L290 TraceCheckUtils]: 79: Hoare triple {44529#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 09:01:00,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {44529#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 09:01:00,505 INFO L290 TraceCheckUtils]: 77: Hoare triple {44519#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 09:01:00,505 INFO L290 TraceCheckUtils]: 76: Hoare triple {44519#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 09:01:00,505 INFO L290 TraceCheckUtils]: 75: Hoare triple {44519#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 09:01:00,506 INFO L290 TraceCheckUtils]: 74: Hoare triple {44509#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 09:01:00,506 INFO L290 TraceCheckUtils]: 73: Hoare triple {44509#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 09:01:00,506 INFO L290 TraceCheckUtils]: 72: Hoare triple {44509#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 09:01:00,506 INFO L290 TraceCheckUtils]: 71: Hoare triple {46387#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 09:01:00,507 INFO L290 TraceCheckUtils]: 70: Hoare triple {46387#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46387#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:01:00,507 INFO L290 TraceCheckUtils]: 69: Hoare triple {46387#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46387#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:01:00,507 INFO L290 TraceCheckUtils]: 68: Hoare triple {46397#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46387#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:01:00,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {46397#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46397#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:01:00,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {46397#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46397#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:01:00,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {46407#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46397#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:01:00,509 INFO L290 TraceCheckUtils]: 64: Hoare triple {46407#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46407#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:01:00,509 INFO L290 TraceCheckUtils]: 63: Hoare triple {46407#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46407#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:01:00,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {46417#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46407#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:01:00,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {46417#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46417#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:01:00,510 INFO L290 TraceCheckUtils]: 60: Hoare triple {46417#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46417#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:01:00,510 INFO L290 TraceCheckUtils]: 59: Hoare triple {46427#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46417#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:01:00,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {46427#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46427#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:01:00,511 INFO L290 TraceCheckUtils]: 57: Hoare triple {46427#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46427#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:01:00,511 INFO L290 TraceCheckUtils]: 56: Hoare triple {46437#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46427#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:01:00,511 INFO L290 TraceCheckUtils]: 55: Hoare triple {46437#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46437#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:01:00,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {46437#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46437#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:01:00,512 INFO L290 TraceCheckUtils]: 53: Hoare triple {46447#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46437#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:01:00,512 INFO L290 TraceCheckUtils]: 52: Hoare triple {46447#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46447#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:01:00,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {46447#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46447#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:01:00,513 INFO L290 TraceCheckUtils]: 50: Hoare triple {46457#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46447#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:01:00,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {46457#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46457#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:01:00,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {46457#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46457#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:01:00,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {46467#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46457#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:01:00,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {46467#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46467#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:01:00,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {46467#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46467#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:01:00,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {46477#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46467#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:01:00,515 INFO L290 TraceCheckUtils]: 43: Hoare triple {46477#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46477#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:01:00,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {46477#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46477#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:01:00,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {46487#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46477#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:01:00,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {46487#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46487#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:01:00,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {46487#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46487#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:01:00,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {46497#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46487#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:01:00,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {46497#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46497#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:01:00,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {46497#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46497#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:01:00,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {46507#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46497#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:01:00,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {46507#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46507#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:01:00,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {46507#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46507#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:01:00,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {46517#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46507#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:01:00,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {46517#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46517#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:01:00,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {46517#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46517#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:01:00,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {46527#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46517#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 09:01:00,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {46527#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46527#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:01:00,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {46527#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46527#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:01:00,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {46537#(<= 0 (+ main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46527#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 09:01:00,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {46537#(<= 0 (+ main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46537#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 09:01:00,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {46537#(<= 0 (+ main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46537#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 09:01:00,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {46537#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 09:01:00,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {44426#true} ~i~0 := 0; {44426#true} is VALID [2022-04-08 09:01:00,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {44426#true} assume !(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:01:00,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 09:01:00,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 09:01:00,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {44426#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {44426#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {44426#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-08 09:01:00,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44426#true} is VALID [2022-04-08 09:01:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 537 proven. 4790 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-08 09:01:00,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108538239] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:00,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:00,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 27, 27] total 54 [2022-04-08 09:01:00,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:00,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [97398104] [2022-04-08 09:01:00,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [97398104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:00,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:00,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:01:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235041765] [2022-04-08 09:01:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:00,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 356 [2022-04-08 09:01:00,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:00,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:00,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:00,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:01:00,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:00,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:01:00,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2044, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 09:01:00,549 INFO L87 Difference]: Start difference. First operand 361 states and 470 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:02,334 INFO L93 Difference]: Finished difference Result 393 states and 507 transitions. [2022-04-08 09:01:02,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:01:02,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 356 [2022-04-08 09:01:02,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-04-08 09:01:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-04-08 09:01:02,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 120 transitions. [2022-04-08 09:01:02,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:02,433 INFO L225 Difference]: With dead ends: 393 [2022-04-08 09:01:02,433 INFO L226 Difference]: Without dead ends: 382 [2022-04-08 09:01:02,433 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=894, Invalid=2528, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 09:01:02,434 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 166 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:02,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 34 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:01:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-04-08 09:01:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 364. [2022-04-08 09:01:03,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:03,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states. Second operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:03,817 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states. Second operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:03,817 INFO L87 Difference]: Start difference. First operand 382 states. Second operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:03,823 INFO L93 Difference]: Finished difference Result 382 states and 495 transitions. [2022-04-08 09:01:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 495 transitions. [2022-04-08 09:01:03,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:03,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:03,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 382 states. [2022-04-08 09:01:03,824 INFO L87 Difference]: Start difference. First operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 382 states. [2022-04-08 09:01:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:03,829 INFO L93 Difference]: Finished difference Result 382 states and 495 transitions. [2022-04-08 09:01:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 495 transitions. [2022-04-08 09:01:03,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:03,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:03,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:03,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 473 transitions. [2022-04-08 09:01:03,836 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 473 transitions. Word has length 356 [2022-04-08 09:01:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:03,837 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 473 transitions. [2022-04-08 09:01:03,837 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:03,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 473 transitions. [2022-04-08 09:01:04,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 473 transitions. [2022-04-08 09:01:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-04-08 09:01:04,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:04,578 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:04,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-08 09:01:04,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-08 09:01:04,779 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:04,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1962575558, now seen corresponding path program 59 times [2022-04-08 09:01:04,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:04,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [368189661] [2022-04-08 09:01:04,783 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:01:04,783 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1962575558, now seen corresponding path program 60 times [2022-04-08 09:01:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:04,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321245522] [2022-04-08 09:01:04,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:05,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {48917#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-08 09:01:05,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-08 09:01:05,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-08 09:01:05,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48917#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:05,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {48917#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-08 09:01:05,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-08 09:01:05,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-08 09:01:05,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-08 09:01:05,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {48906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,078 INFO L290 TraceCheckUtils]: 47: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,078 INFO L290 TraceCheckUtils]: 49: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,079 INFO L290 TraceCheckUtils]: 50: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,079 INFO L290 TraceCheckUtils]: 51: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,079 INFO L290 TraceCheckUtils]: 52: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,080 INFO L290 TraceCheckUtils]: 55: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,080 INFO L290 TraceCheckUtils]: 56: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,080 INFO L290 TraceCheckUtils]: 57: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,080 INFO L290 TraceCheckUtils]: 58: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,080 INFO L290 TraceCheckUtils]: 59: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,081 INFO L290 TraceCheckUtils]: 60: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,081 INFO L290 TraceCheckUtils]: 61: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,081 INFO L290 TraceCheckUtils]: 62: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,081 INFO L290 TraceCheckUtils]: 63: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,081 INFO L290 TraceCheckUtils]: 64: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,082 INFO L290 TraceCheckUtils]: 65: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,082 INFO L290 TraceCheckUtils]: 67: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,082 INFO L290 TraceCheckUtils]: 68: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,083 INFO L290 TraceCheckUtils]: 69: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,083 INFO L290 TraceCheckUtils]: 70: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,083 INFO L290 TraceCheckUtils]: 71: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,083 INFO L290 TraceCheckUtils]: 72: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,083 INFO L290 TraceCheckUtils]: 73: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,084 INFO L290 TraceCheckUtils]: 74: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,084 INFO L290 TraceCheckUtils]: 75: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,084 INFO L290 TraceCheckUtils]: 76: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,084 INFO L290 TraceCheckUtils]: 77: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,084 INFO L290 TraceCheckUtils]: 78: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,085 INFO L290 TraceCheckUtils]: 79: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,085 INFO L290 TraceCheckUtils]: 80: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,085 INFO L290 TraceCheckUtils]: 81: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,085 INFO L290 TraceCheckUtils]: 82: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,085 INFO L290 TraceCheckUtils]: 83: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,086 INFO L290 TraceCheckUtils]: 84: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,086 INFO L290 TraceCheckUtils]: 85: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,086 INFO L290 TraceCheckUtils]: 86: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,086 INFO L290 TraceCheckUtils]: 87: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,086 INFO L290 TraceCheckUtils]: 88: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,087 INFO L290 TraceCheckUtils]: 90: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,087 INFO L290 TraceCheckUtils]: 91: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,087 INFO L290 TraceCheckUtils]: 92: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,087 INFO L290 TraceCheckUtils]: 93: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,088 INFO L290 TraceCheckUtils]: 94: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,088 INFO L290 TraceCheckUtils]: 95: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,088 INFO L290 TraceCheckUtils]: 96: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,088 INFO L290 TraceCheckUtils]: 97: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,088 INFO L290 TraceCheckUtils]: 98: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,089 INFO L290 TraceCheckUtils]: 99: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,089 INFO L290 TraceCheckUtils]: 100: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,089 INFO L290 TraceCheckUtils]: 101: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,089 INFO L290 TraceCheckUtils]: 102: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,089 INFO L290 TraceCheckUtils]: 103: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,090 INFO L290 TraceCheckUtils]: 104: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,090 INFO L290 TraceCheckUtils]: 105: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,090 INFO L290 TraceCheckUtils]: 106: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,090 INFO L290 TraceCheckUtils]: 107: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,090 INFO L290 TraceCheckUtils]: 108: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,091 INFO L290 TraceCheckUtils]: 109: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,091 INFO L290 TraceCheckUtils]: 110: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,091 INFO L290 TraceCheckUtils]: 111: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,091 INFO L290 TraceCheckUtils]: 112: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,091 INFO L290 TraceCheckUtils]: 113: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,092 INFO L290 TraceCheckUtils]: 114: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,092 INFO L290 TraceCheckUtils]: 115: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,092 INFO L290 TraceCheckUtils]: 116: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,092 INFO L290 TraceCheckUtils]: 117: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,092 INFO L290 TraceCheckUtils]: 118: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,093 INFO L290 TraceCheckUtils]: 119: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,093 INFO L290 TraceCheckUtils]: 120: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,093 INFO L290 TraceCheckUtils]: 121: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,093 INFO L290 TraceCheckUtils]: 122: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,093 INFO L290 TraceCheckUtils]: 123: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,094 INFO L290 TraceCheckUtils]: 124: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,094 INFO L290 TraceCheckUtils]: 125: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,094 INFO L290 TraceCheckUtils]: 126: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,094 INFO L290 TraceCheckUtils]: 127: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,094 INFO L290 TraceCheckUtils]: 128: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,095 INFO L290 TraceCheckUtils]: 129: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,095 INFO L290 TraceCheckUtils]: 130: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,095 INFO L290 TraceCheckUtils]: 131: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,095 INFO L290 TraceCheckUtils]: 132: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,096 INFO L290 TraceCheckUtils]: 133: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,096 INFO L290 TraceCheckUtils]: 134: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,096 INFO L290 TraceCheckUtils]: 135: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,096 INFO L290 TraceCheckUtils]: 136: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,096 INFO L290 TraceCheckUtils]: 137: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,097 INFO L290 TraceCheckUtils]: 138: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,097 INFO L290 TraceCheckUtils]: 139: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,097 INFO L290 TraceCheckUtils]: 140: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,097 INFO L290 TraceCheckUtils]: 141: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,097 INFO L290 TraceCheckUtils]: 142: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,098 INFO L290 TraceCheckUtils]: 143: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,098 INFO L290 TraceCheckUtils]: 144: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,098 INFO L290 TraceCheckUtils]: 145: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,098 INFO L290 TraceCheckUtils]: 146: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,098 INFO L290 TraceCheckUtils]: 147: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,099 INFO L290 TraceCheckUtils]: 148: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,099 INFO L290 TraceCheckUtils]: 149: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,099 INFO L290 TraceCheckUtils]: 150: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,099 INFO L290 TraceCheckUtils]: 151: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,099 INFO L290 TraceCheckUtils]: 152: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,100 INFO L290 TraceCheckUtils]: 153: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,100 INFO L290 TraceCheckUtils]: 154: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,100 INFO L290 TraceCheckUtils]: 155: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,100 INFO L290 TraceCheckUtils]: 156: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,100 INFO L290 TraceCheckUtils]: 157: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,101 INFO L290 TraceCheckUtils]: 158: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,101 INFO L290 TraceCheckUtils]: 159: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,101 INFO L290 TraceCheckUtils]: 160: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,101 INFO L290 TraceCheckUtils]: 161: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,101 INFO L290 TraceCheckUtils]: 162: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,102 INFO L290 TraceCheckUtils]: 163: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,102 INFO L290 TraceCheckUtils]: 164: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,102 INFO L290 TraceCheckUtils]: 165: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,102 INFO L290 TraceCheckUtils]: 166: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,103 INFO L290 TraceCheckUtils]: 167: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,103 INFO L290 TraceCheckUtils]: 168: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,103 INFO L290 TraceCheckUtils]: 169: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,103 INFO L290 TraceCheckUtils]: 170: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,103 INFO L290 TraceCheckUtils]: 171: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,104 INFO L290 TraceCheckUtils]: 172: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,104 INFO L290 TraceCheckUtils]: 173: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,104 INFO L290 TraceCheckUtils]: 174: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,104 INFO L290 TraceCheckUtils]: 175: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,104 INFO L290 TraceCheckUtils]: 176: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,105 INFO L290 TraceCheckUtils]: 177: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,105 INFO L290 TraceCheckUtils]: 178: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,105 INFO L290 TraceCheckUtils]: 179: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,105 INFO L290 TraceCheckUtils]: 180: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,105 INFO L290 TraceCheckUtils]: 181: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,106 INFO L290 TraceCheckUtils]: 182: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,106 INFO L290 TraceCheckUtils]: 183: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,106 INFO L290 TraceCheckUtils]: 184: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,106 INFO L290 TraceCheckUtils]: 185: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,106 INFO L290 TraceCheckUtils]: 186: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,107 INFO L290 TraceCheckUtils]: 187: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,107 INFO L290 TraceCheckUtils]: 188: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,107 INFO L290 TraceCheckUtils]: 189: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,107 INFO L290 TraceCheckUtils]: 190: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,108 INFO L290 TraceCheckUtils]: 191: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,108 INFO L290 TraceCheckUtils]: 192: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,108 INFO L290 TraceCheckUtils]: 193: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,108 INFO L290 TraceCheckUtils]: 194: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,108 INFO L290 TraceCheckUtils]: 195: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,109 INFO L290 TraceCheckUtils]: 196: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,109 INFO L290 TraceCheckUtils]: 197: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,109 INFO L290 TraceCheckUtils]: 198: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,109 INFO L290 TraceCheckUtils]: 199: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,109 INFO L290 TraceCheckUtils]: 200: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,110 INFO L290 TraceCheckUtils]: 201: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,110 INFO L290 TraceCheckUtils]: 202: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,110 INFO L290 TraceCheckUtils]: 203: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,110 INFO L290 TraceCheckUtils]: 204: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,111 INFO L290 TraceCheckUtils]: 205: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,111 INFO L290 TraceCheckUtils]: 206: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,111 INFO L290 TraceCheckUtils]: 207: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,111 INFO L290 TraceCheckUtils]: 208: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,111 INFO L290 TraceCheckUtils]: 209: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,112 INFO L290 TraceCheckUtils]: 210: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,112 INFO L290 TraceCheckUtils]: 211: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,112 INFO L290 TraceCheckUtils]: 212: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,112 INFO L290 TraceCheckUtils]: 213: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,112 INFO L290 TraceCheckUtils]: 214: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,113 INFO L290 TraceCheckUtils]: 215: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,113 INFO L290 TraceCheckUtils]: 216: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,113 INFO L290 TraceCheckUtils]: 217: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,113 INFO L290 TraceCheckUtils]: 218: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,113 INFO L290 TraceCheckUtils]: 219: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,114 INFO L290 TraceCheckUtils]: 220: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,114 INFO L290 TraceCheckUtils]: 221: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,114 INFO L290 TraceCheckUtils]: 222: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,114 INFO L290 TraceCheckUtils]: 223: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,114 INFO L290 TraceCheckUtils]: 224: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,115 INFO L290 TraceCheckUtils]: 225: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,115 INFO L290 TraceCheckUtils]: 226: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,115 INFO L290 TraceCheckUtils]: 227: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,115 INFO L290 TraceCheckUtils]: 228: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,116 INFO L290 TraceCheckUtils]: 229: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,116 INFO L290 TraceCheckUtils]: 230: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,116 INFO L290 TraceCheckUtils]: 231: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,116 INFO L290 TraceCheckUtils]: 232: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,116 INFO L290 TraceCheckUtils]: 233: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,117 INFO L290 TraceCheckUtils]: 234: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,117 INFO L290 TraceCheckUtils]: 235: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,117 INFO L290 TraceCheckUtils]: 236: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,117 INFO L290 TraceCheckUtils]: 237: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,117 INFO L290 TraceCheckUtils]: 238: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,118 INFO L290 TraceCheckUtils]: 239: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,118 INFO L290 TraceCheckUtils]: 240: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,118 INFO L290 TraceCheckUtils]: 241: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,118 INFO L290 TraceCheckUtils]: 242: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,118 INFO L290 TraceCheckUtils]: 243: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,119 INFO L290 TraceCheckUtils]: 244: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,119 INFO L290 TraceCheckUtils]: 245: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,119 INFO L290 TraceCheckUtils]: 246: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,119 INFO L290 TraceCheckUtils]: 247: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,120 INFO L290 TraceCheckUtils]: 248: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,120 INFO L290 TraceCheckUtils]: 249: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,120 INFO L290 TraceCheckUtils]: 250: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,120 INFO L290 TraceCheckUtils]: 251: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,120 INFO L290 TraceCheckUtils]: 252: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,121 INFO L290 TraceCheckUtils]: 253: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,121 INFO L290 TraceCheckUtils]: 254: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,121 INFO L290 TraceCheckUtils]: 255: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,121 INFO L290 TraceCheckUtils]: 256: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,121 INFO L290 TraceCheckUtils]: 257: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,122 INFO L290 TraceCheckUtils]: 258: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,122 INFO L290 TraceCheckUtils]: 259: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,122 INFO L290 TraceCheckUtils]: 260: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,122 INFO L290 TraceCheckUtils]: 261: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,122 INFO L290 TraceCheckUtils]: 262: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,123 INFO L290 TraceCheckUtils]: 263: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,123 INFO L290 TraceCheckUtils]: 264: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,123 INFO L290 TraceCheckUtils]: 265: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,123 INFO L290 TraceCheckUtils]: 266: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,123 INFO L290 TraceCheckUtils]: 267: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,124 INFO L290 TraceCheckUtils]: 268: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,124 INFO L290 TraceCheckUtils]: 269: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,124 INFO L290 TraceCheckUtils]: 270: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,124 INFO L290 TraceCheckUtils]: 271: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,124 INFO L290 TraceCheckUtils]: 272: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,125 INFO L290 TraceCheckUtils]: 273: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,125 INFO L290 TraceCheckUtils]: 274: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,125 INFO L290 TraceCheckUtils]: 275: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,125 INFO L290 TraceCheckUtils]: 276: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,125 INFO L290 TraceCheckUtils]: 277: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,126 INFO L290 TraceCheckUtils]: 278: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,126 INFO L290 TraceCheckUtils]: 279: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,126 INFO L290 TraceCheckUtils]: 280: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,126 INFO L290 TraceCheckUtils]: 281: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,126 INFO L290 TraceCheckUtils]: 282: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,127 INFO L290 TraceCheckUtils]: 283: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,127 INFO L290 TraceCheckUtils]: 284: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,127 INFO L290 TraceCheckUtils]: 285: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,127 INFO L290 TraceCheckUtils]: 286: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,127 INFO L290 TraceCheckUtils]: 287: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,128 INFO L290 TraceCheckUtils]: 288: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,128 INFO L290 TraceCheckUtils]: 289: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,128 INFO L290 TraceCheckUtils]: 290: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,128 INFO L290 TraceCheckUtils]: 291: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,128 INFO L290 TraceCheckUtils]: 292: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,129 INFO L290 TraceCheckUtils]: 293: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,129 INFO L290 TraceCheckUtils]: 294: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,129 INFO L290 TraceCheckUtils]: 295: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,129 INFO L290 TraceCheckUtils]: 296: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,129 INFO L290 TraceCheckUtils]: 297: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,130 INFO L290 TraceCheckUtils]: 298: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,130 INFO L290 TraceCheckUtils]: 299: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,130 INFO L290 TraceCheckUtils]: 300: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,130 INFO L290 TraceCheckUtils]: 301: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,130 INFO L290 TraceCheckUtils]: 302: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,131 INFO L290 TraceCheckUtils]: 303: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,131 INFO L290 TraceCheckUtils]: 304: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,131 INFO L290 TraceCheckUtils]: 305: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,131 INFO L290 TraceCheckUtils]: 306: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,131 INFO L290 TraceCheckUtils]: 307: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,132 INFO L290 TraceCheckUtils]: 308: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,132 INFO L290 TraceCheckUtils]: 309: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,132 INFO L290 TraceCheckUtils]: 310: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,132 INFO L290 TraceCheckUtils]: 311: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,132 INFO L290 TraceCheckUtils]: 312: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,133 INFO L290 TraceCheckUtils]: 313: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,133 INFO L290 TraceCheckUtils]: 314: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,133 INFO L290 TraceCheckUtils]: 315: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,133 INFO L290 TraceCheckUtils]: 316: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,134 INFO L290 TraceCheckUtils]: 317: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,134 INFO L290 TraceCheckUtils]: 318: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,134 INFO L290 TraceCheckUtils]: 319: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,134 INFO L290 TraceCheckUtils]: 320: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,134 INFO L290 TraceCheckUtils]: 321: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,135 INFO L290 TraceCheckUtils]: 322: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,135 INFO L290 TraceCheckUtils]: 323: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,135 INFO L290 TraceCheckUtils]: 324: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,135 INFO L290 TraceCheckUtils]: 325: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,135 INFO L290 TraceCheckUtils]: 326: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,136 INFO L290 TraceCheckUtils]: 327: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,136 INFO L290 TraceCheckUtils]: 328: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,136 INFO L290 TraceCheckUtils]: 329: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,136 INFO L290 TraceCheckUtils]: 330: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,136 INFO L290 TraceCheckUtils]: 331: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,137 INFO L290 TraceCheckUtils]: 332: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,137 INFO L290 TraceCheckUtils]: 333: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,137 INFO L290 TraceCheckUtils]: 334: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,137 INFO L290 TraceCheckUtils]: 335: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,137 INFO L290 TraceCheckUtils]: 336: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,138 INFO L290 TraceCheckUtils]: 337: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,138 INFO L290 TraceCheckUtils]: 338: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:05,138 INFO L290 TraceCheckUtils]: 339: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:05,139 INFO L290 TraceCheckUtils]: 340: Hoare triple {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:05,139 INFO L290 TraceCheckUtils]: 341: Hoare triple {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:05,139 INFO L290 TraceCheckUtils]: 342: Hoare triple {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:05,139 INFO L290 TraceCheckUtils]: 343: Hoare triple {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:05,140 INFO L290 TraceCheckUtils]: 344: Hoare triple {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:05,140 INFO L290 TraceCheckUtils]: 345: Hoare triple {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:01:05,140 INFO L290 TraceCheckUtils]: 346: Hoare triple {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:01:05,141 INFO L290 TraceCheckUtils]: 347: Hoare triple {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:01:05,141 INFO L290 TraceCheckUtils]: 348: Hoare triple {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:01:05,141 INFO L290 TraceCheckUtils]: 349: Hoare triple {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:01:05,141 INFO L290 TraceCheckUtils]: 350: Hoare triple {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:01:05,142 INFO L290 TraceCheckUtils]: 351: Hoare triple {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48916#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:01:05,142 INFO L290 TraceCheckUtils]: 352: Hoare triple {48916#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {48907#false} is VALID [2022-04-08 09:01:05,142 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-08 09:01:05,142 INFO L290 TraceCheckUtils]: 354: Hoare triple {48907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48907#false} is VALID [2022-04-08 09:01:05,142 INFO L272 TraceCheckUtils]: 355: Hoare triple {48907#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {48907#false} is VALID [2022-04-08 09:01:05,142 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-08 09:01:05,142 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-08 09:01:05,142 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-08 09:01:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15442 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:01:05,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:05,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321245522] [2022-04-08 09:01:05,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321245522] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:05,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522347973] [2022-04-08 09:01:05,143 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:01:05,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:05,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:05,144 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:01:05,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 09:01:06,706 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 09:01:06,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:06,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:01:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:06,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:07,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48906#true} is VALID [2022-04-08 09:01:07,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {48906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-08 09:01:07,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-08 09:01:07,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-08 09:01:07,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-08 09:01:07,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {48906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,986 INFO L290 TraceCheckUtils]: 39: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,989 INFO L290 TraceCheckUtils]: 51: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,989 INFO L290 TraceCheckUtils]: 54: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,989 INFO L290 TraceCheckUtils]: 55: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,990 INFO L290 TraceCheckUtils]: 58: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,990 INFO L290 TraceCheckUtils]: 59: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,991 INFO L290 TraceCheckUtils]: 60: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,991 INFO L290 TraceCheckUtils]: 62: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,991 INFO L290 TraceCheckUtils]: 63: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,991 INFO L290 TraceCheckUtils]: 64: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,992 INFO L290 TraceCheckUtils]: 65: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,992 INFO L290 TraceCheckUtils]: 67: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,992 INFO L290 TraceCheckUtils]: 68: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,993 INFO L290 TraceCheckUtils]: 69: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,993 INFO L290 TraceCheckUtils]: 70: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,993 INFO L290 TraceCheckUtils]: 71: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,993 INFO L290 TraceCheckUtils]: 72: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,994 INFO L290 TraceCheckUtils]: 73: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,994 INFO L290 TraceCheckUtils]: 74: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,994 INFO L290 TraceCheckUtils]: 75: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,994 INFO L290 TraceCheckUtils]: 76: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,995 INFO L290 TraceCheckUtils]: 77: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,995 INFO L290 TraceCheckUtils]: 78: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,995 INFO L290 TraceCheckUtils]: 79: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,995 INFO L290 TraceCheckUtils]: 80: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,995 INFO L290 TraceCheckUtils]: 81: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,996 INFO L290 TraceCheckUtils]: 82: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,996 INFO L290 TraceCheckUtils]: 83: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,996 INFO L290 TraceCheckUtils]: 84: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,997 INFO L290 TraceCheckUtils]: 86: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,997 INFO L290 TraceCheckUtils]: 87: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,997 INFO L290 TraceCheckUtils]: 88: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,997 INFO L290 TraceCheckUtils]: 89: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,998 INFO L290 TraceCheckUtils]: 90: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,998 INFO L290 TraceCheckUtils]: 91: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,998 INFO L290 TraceCheckUtils]: 92: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,998 INFO L290 TraceCheckUtils]: 93: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,999 INFO L290 TraceCheckUtils]: 94: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,999 INFO L290 TraceCheckUtils]: 95: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,999 INFO L290 TraceCheckUtils]: 96: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,999 INFO L290 TraceCheckUtils]: 97: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:07,999 INFO L290 TraceCheckUtils]: 98: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,000 INFO L290 TraceCheckUtils]: 99: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,000 INFO L290 TraceCheckUtils]: 100: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,000 INFO L290 TraceCheckUtils]: 101: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,000 INFO L290 TraceCheckUtils]: 102: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,001 INFO L290 TraceCheckUtils]: 103: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,001 INFO L290 TraceCheckUtils]: 104: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,001 INFO L290 TraceCheckUtils]: 105: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,001 INFO L290 TraceCheckUtils]: 106: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,002 INFO L290 TraceCheckUtils]: 107: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,002 INFO L290 TraceCheckUtils]: 108: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,002 INFO L290 TraceCheckUtils]: 109: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,002 INFO L290 TraceCheckUtils]: 110: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,003 INFO L290 TraceCheckUtils]: 111: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,003 INFO L290 TraceCheckUtils]: 112: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,003 INFO L290 TraceCheckUtils]: 113: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,003 INFO L290 TraceCheckUtils]: 114: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,003 INFO L290 TraceCheckUtils]: 115: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,004 INFO L290 TraceCheckUtils]: 116: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,004 INFO L290 TraceCheckUtils]: 117: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,004 INFO L290 TraceCheckUtils]: 118: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,004 INFO L290 TraceCheckUtils]: 119: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,005 INFO L290 TraceCheckUtils]: 120: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,005 INFO L290 TraceCheckUtils]: 121: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,005 INFO L290 TraceCheckUtils]: 122: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,005 INFO L290 TraceCheckUtils]: 123: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,006 INFO L290 TraceCheckUtils]: 124: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,006 INFO L290 TraceCheckUtils]: 125: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,006 INFO L290 TraceCheckUtils]: 126: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,006 INFO L290 TraceCheckUtils]: 127: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,006 INFO L290 TraceCheckUtils]: 128: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,007 INFO L290 TraceCheckUtils]: 129: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,007 INFO L290 TraceCheckUtils]: 130: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,007 INFO L290 TraceCheckUtils]: 131: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,007 INFO L290 TraceCheckUtils]: 132: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,008 INFO L290 TraceCheckUtils]: 133: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,008 INFO L290 TraceCheckUtils]: 134: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,008 INFO L290 TraceCheckUtils]: 135: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,008 INFO L290 TraceCheckUtils]: 136: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,009 INFO L290 TraceCheckUtils]: 137: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,009 INFO L290 TraceCheckUtils]: 138: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,009 INFO L290 TraceCheckUtils]: 139: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,009 INFO L290 TraceCheckUtils]: 140: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,010 INFO L290 TraceCheckUtils]: 141: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,010 INFO L290 TraceCheckUtils]: 142: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,010 INFO L290 TraceCheckUtils]: 143: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,010 INFO L290 TraceCheckUtils]: 144: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,010 INFO L290 TraceCheckUtils]: 145: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,011 INFO L290 TraceCheckUtils]: 146: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,011 INFO L290 TraceCheckUtils]: 147: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,011 INFO L290 TraceCheckUtils]: 148: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,011 INFO L290 TraceCheckUtils]: 149: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,012 INFO L290 TraceCheckUtils]: 150: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,012 INFO L290 TraceCheckUtils]: 151: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,012 INFO L290 TraceCheckUtils]: 152: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,012 INFO L290 TraceCheckUtils]: 153: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,013 INFO L290 TraceCheckUtils]: 154: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,013 INFO L290 TraceCheckUtils]: 155: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,013 INFO L290 TraceCheckUtils]: 156: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,013 INFO L290 TraceCheckUtils]: 157: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,013 INFO L290 TraceCheckUtils]: 158: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,014 INFO L290 TraceCheckUtils]: 159: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,014 INFO L290 TraceCheckUtils]: 160: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,014 INFO L290 TraceCheckUtils]: 161: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,014 INFO L290 TraceCheckUtils]: 162: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,015 INFO L290 TraceCheckUtils]: 163: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,015 INFO L290 TraceCheckUtils]: 164: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,015 INFO L290 TraceCheckUtils]: 165: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,015 INFO L290 TraceCheckUtils]: 166: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,016 INFO L290 TraceCheckUtils]: 167: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,016 INFO L290 TraceCheckUtils]: 168: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,016 INFO L290 TraceCheckUtils]: 169: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,016 INFO L290 TraceCheckUtils]: 170: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,017 INFO L290 TraceCheckUtils]: 171: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,017 INFO L290 TraceCheckUtils]: 172: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,017 INFO L290 TraceCheckUtils]: 173: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,017 INFO L290 TraceCheckUtils]: 174: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,017 INFO L290 TraceCheckUtils]: 175: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,018 INFO L290 TraceCheckUtils]: 176: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,018 INFO L290 TraceCheckUtils]: 177: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,018 INFO L290 TraceCheckUtils]: 178: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,018 INFO L290 TraceCheckUtils]: 179: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,019 INFO L290 TraceCheckUtils]: 180: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,019 INFO L290 TraceCheckUtils]: 181: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,019 INFO L290 TraceCheckUtils]: 182: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,019 INFO L290 TraceCheckUtils]: 183: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,020 INFO L290 TraceCheckUtils]: 184: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,020 INFO L290 TraceCheckUtils]: 185: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,020 INFO L290 TraceCheckUtils]: 186: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,020 INFO L290 TraceCheckUtils]: 187: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,021 INFO L290 TraceCheckUtils]: 188: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,021 INFO L290 TraceCheckUtils]: 189: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,021 INFO L290 TraceCheckUtils]: 190: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,021 INFO L290 TraceCheckUtils]: 191: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,021 INFO L290 TraceCheckUtils]: 192: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,022 INFO L290 TraceCheckUtils]: 193: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,022 INFO L290 TraceCheckUtils]: 194: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,022 INFO L290 TraceCheckUtils]: 195: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,022 INFO L290 TraceCheckUtils]: 196: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,023 INFO L290 TraceCheckUtils]: 197: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,023 INFO L290 TraceCheckUtils]: 198: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,023 INFO L290 TraceCheckUtils]: 199: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,023 INFO L290 TraceCheckUtils]: 200: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,024 INFO L290 TraceCheckUtils]: 201: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,024 INFO L290 TraceCheckUtils]: 202: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,024 INFO L290 TraceCheckUtils]: 203: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,024 INFO L290 TraceCheckUtils]: 204: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,024 INFO L290 TraceCheckUtils]: 205: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,025 INFO L290 TraceCheckUtils]: 206: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,025 INFO L290 TraceCheckUtils]: 207: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,025 INFO L290 TraceCheckUtils]: 208: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,025 INFO L290 TraceCheckUtils]: 209: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,026 INFO L290 TraceCheckUtils]: 210: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,026 INFO L290 TraceCheckUtils]: 211: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,026 INFO L290 TraceCheckUtils]: 212: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,026 INFO L290 TraceCheckUtils]: 213: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,027 INFO L290 TraceCheckUtils]: 214: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,027 INFO L290 TraceCheckUtils]: 215: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,027 INFO L290 TraceCheckUtils]: 216: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,027 INFO L290 TraceCheckUtils]: 217: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,027 INFO L290 TraceCheckUtils]: 218: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,028 INFO L290 TraceCheckUtils]: 219: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,028 INFO L290 TraceCheckUtils]: 220: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,028 INFO L290 TraceCheckUtils]: 221: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,028 INFO L290 TraceCheckUtils]: 222: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,029 INFO L290 TraceCheckUtils]: 223: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,029 INFO L290 TraceCheckUtils]: 224: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,029 INFO L290 TraceCheckUtils]: 225: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,029 INFO L290 TraceCheckUtils]: 226: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,030 INFO L290 TraceCheckUtils]: 227: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,030 INFO L290 TraceCheckUtils]: 228: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,030 INFO L290 TraceCheckUtils]: 229: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,030 INFO L290 TraceCheckUtils]: 230: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,030 INFO L290 TraceCheckUtils]: 231: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,031 INFO L290 TraceCheckUtils]: 232: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,031 INFO L290 TraceCheckUtils]: 233: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,031 INFO L290 TraceCheckUtils]: 234: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,031 INFO L290 TraceCheckUtils]: 235: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,032 INFO L290 TraceCheckUtils]: 236: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,032 INFO L290 TraceCheckUtils]: 237: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,032 INFO L290 TraceCheckUtils]: 238: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,032 INFO L290 TraceCheckUtils]: 239: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,033 INFO L290 TraceCheckUtils]: 240: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,033 INFO L290 TraceCheckUtils]: 241: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,033 INFO L290 TraceCheckUtils]: 242: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,033 INFO L290 TraceCheckUtils]: 243: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,033 INFO L290 TraceCheckUtils]: 244: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,034 INFO L290 TraceCheckUtils]: 245: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,034 INFO L290 TraceCheckUtils]: 246: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,034 INFO L290 TraceCheckUtils]: 247: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,034 INFO L290 TraceCheckUtils]: 248: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,035 INFO L290 TraceCheckUtils]: 249: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,035 INFO L290 TraceCheckUtils]: 250: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,035 INFO L290 TraceCheckUtils]: 251: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,035 INFO L290 TraceCheckUtils]: 252: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,036 INFO L290 TraceCheckUtils]: 253: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,036 INFO L290 TraceCheckUtils]: 254: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,036 INFO L290 TraceCheckUtils]: 255: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,036 INFO L290 TraceCheckUtils]: 256: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,037 INFO L290 TraceCheckUtils]: 257: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,037 INFO L290 TraceCheckUtils]: 258: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,037 INFO L290 TraceCheckUtils]: 259: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,037 INFO L290 TraceCheckUtils]: 260: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,037 INFO L290 TraceCheckUtils]: 261: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,038 INFO L290 TraceCheckUtils]: 262: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,038 INFO L290 TraceCheckUtils]: 263: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,038 INFO L290 TraceCheckUtils]: 264: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,038 INFO L290 TraceCheckUtils]: 265: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,039 INFO L290 TraceCheckUtils]: 266: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,039 INFO L290 TraceCheckUtils]: 267: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,039 INFO L290 TraceCheckUtils]: 268: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,039 INFO L290 TraceCheckUtils]: 269: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,040 INFO L290 TraceCheckUtils]: 270: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,040 INFO L290 TraceCheckUtils]: 271: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,040 INFO L290 TraceCheckUtils]: 272: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,040 INFO L290 TraceCheckUtils]: 273: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,040 INFO L290 TraceCheckUtils]: 274: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,041 INFO L290 TraceCheckUtils]: 275: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,041 INFO L290 TraceCheckUtils]: 276: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,041 INFO L290 TraceCheckUtils]: 277: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,041 INFO L290 TraceCheckUtils]: 278: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,042 INFO L290 TraceCheckUtils]: 279: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,042 INFO L290 TraceCheckUtils]: 280: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,042 INFO L290 TraceCheckUtils]: 281: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,042 INFO L290 TraceCheckUtils]: 282: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,043 INFO L290 TraceCheckUtils]: 283: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,043 INFO L290 TraceCheckUtils]: 284: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,043 INFO L290 TraceCheckUtils]: 285: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,043 INFO L290 TraceCheckUtils]: 286: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,043 INFO L290 TraceCheckUtils]: 287: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,044 INFO L290 TraceCheckUtils]: 288: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,044 INFO L290 TraceCheckUtils]: 289: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,044 INFO L290 TraceCheckUtils]: 290: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,044 INFO L290 TraceCheckUtils]: 291: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,045 INFO L290 TraceCheckUtils]: 292: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,045 INFO L290 TraceCheckUtils]: 293: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,045 INFO L290 TraceCheckUtils]: 294: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,045 INFO L290 TraceCheckUtils]: 295: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,046 INFO L290 TraceCheckUtils]: 296: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,046 INFO L290 TraceCheckUtils]: 297: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,046 INFO L290 TraceCheckUtils]: 298: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,046 INFO L290 TraceCheckUtils]: 299: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,046 INFO L290 TraceCheckUtils]: 300: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,047 INFO L290 TraceCheckUtils]: 301: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,047 INFO L290 TraceCheckUtils]: 302: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,047 INFO L290 TraceCheckUtils]: 303: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,047 INFO L290 TraceCheckUtils]: 304: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,048 INFO L290 TraceCheckUtils]: 305: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,048 INFO L290 TraceCheckUtils]: 306: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,048 INFO L290 TraceCheckUtils]: 307: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,048 INFO L290 TraceCheckUtils]: 308: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,049 INFO L290 TraceCheckUtils]: 309: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,049 INFO L290 TraceCheckUtils]: 310: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,049 INFO L290 TraceCheckUtils]: 311: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,049 INFO L290 TraceCheckUtils]: 312: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,050 INFO L290 TraceCheckUtils]: 313: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,050 INFO L290 TraceCheckUtils]: 314: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,050 INFO L290 TraceCheckUtils]: 315: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,050 INFO L290 TraceCheckUtils]: 316: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,050 INFO L290 TraceCheckUtils]: 317: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,051 INFO L290 TraceCheckUtils]: 318: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,051 INFO L290 TraceCheckUtils]: 319: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,051 INFO L290 TraceCheckUtils]: 320: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,051 INFO L290 TraceCheckUtils]: 321: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,052 INFO L290 TraceCheckUtils]: 322: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,052 INFO L290 TraceCheckUtils]: 323: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,052 INFO L290 TraceCheckUtils]: 324: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,052 INFO L290 TraceCheckUtils]: 325: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,053 INFO L290 TraceCheckUtils]: 326: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,053 INFO L290 TraceCheckUtils]: 327: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,053 INFO L290 TraceCheckUtils]: 328: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,053 INFO L290 TraceCheckUtils]: 329: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,054 INFO L290 TraceCheckUtils]: 330: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,054 INFO L290 TraceCheckUtils]: 331: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,054 INFO L290 TraceCheckUtils]: 332: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,054 INFO L290 TraceCheckUtils]: 333: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,054 INFO L290 TraceCheckUtils]: 334: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,055 INFO L290 TraceCheckUtils]: 335: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,055 INFO L290 TraceCheckUtils]: 336: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,055 INFO L290 TraceCheckUtils]: 337: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,055 INFO L290 TraceCheckUtils]: 338: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:08,056 INFO L290 TraceCheckUtils]: 339: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:08,056 INFO L290 TraceCheckUtils]: 340: Hoare triple {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:08,057 INFO L290 TraceCheckUtils]: 341: Hoare triple {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:08,057 INFO L290 TraceCheckUtils]: 342: Hoare triple {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:08,057 INFO L290 TraceCheckUtils]: 343: Hoare triple {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:08,058 INFO L290 TraceCheckUtils]: 344: Hoare triple {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:08,058 INFO L290 TraceCheckUtils]: 345: Hoare triple {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:08,058 INFO L290 TraceCheckUtils]: 346: Hoare triple {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:08,059 INFO L290 TraceCheckUtils]: 347: Hoare triple {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:08,059 INFO L290 TraceCheckUtils]: 348: Hoare triple {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:08,060 INFO L290 TraceCheckUtils]: 349: Hoare triple {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:08,060 INFO L290 TraceCheckUtils]: 350: Hoare triple {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:08,060 INFO L290 TraceCheckUtils]: 351: Hoare triple {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49978#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 09:01:08,061 INFO L290 TraceCheckUtils]: 352: Hoare triple {49978#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !(~i~0 < ~edgecount~0); {48907#false} is VALID [2022-04-08 09:01:08,061 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-08 09:01:08,061 INFO L290 TraceCheckUtils]: 354: Hoare triple {48907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48907#false} is VALID [2022-04-08 09:01:08,061 INFO L272 TraceCheckUtils]: 355: Hoare triple {48907#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {48907#false} is VALID [2022-04-08 09:01:08,061 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-08 09:01:08,061 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-08 09:01:08,061 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-08 09:01:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15442 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:01:08,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:09,113 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-08 09:01:09,114 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-08 09:01:09,114 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-08 09:01:09,114 INFO L272 TraceCheckUtils]: 355: Hoare triple {48907#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {48907#false} is VALID [2022-04-08 09:01:09,114 INFO L290 TraceCheckUtils]: 354: Hoare triple {48907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48907#false} is VALID [2022-04-08 09:01:09,114 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-08 09:01:09,114 INFO L290 TraceCheckUtils]: 352: Hoare triple {50018#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {48907#false} is VALID [2022-04-08 09:01:09,114 INFO L290 TraceCheckUtils]: 351: Hoare triple {50022#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50018#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,115 INFO L290 TraceCheckUtils]: 350: Hoare triple {50022#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50022#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,115 INFO L290 TraceCheckUtils]: 349: Hoare triple {50022#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50022#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,115 INFO L290 TraceCheckUtils]: 348: Hoare triple {50032#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50022#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,116 INFO L290 TraceCheckUtils]: 347: Hoare triple {50032#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50032#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,116 INFO L290 TraceCheckUtils]: 346: Hoare triple {50032#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50032#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,116 INFO L290 TraceCheckUtils]: 345: Hoare triple {50042#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50032#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,116 INFO L290 TraceCheckUtils]: 344: Hoare triple {50042#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50042#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,117 INFO L290 TraceCheckUtils]: 343: Hoare triple {50042#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50042#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,117 INFO L290 TraceCheckUtils]: 342: Hoare triple {50052#(< (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50042#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,117 INFO L290 TraceCheckUtils]: 341: Hoare triple {50052#(< (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50052#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,117 INFO L290 TraceCheckUtils]: 340: Hoare triple {50052#(< (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50052#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,118 INFO L290 TraceCheckUtils]: 339: Hoare triple {50062#(< 4 main_~edgecount~0)} ~i~0 := 0; {50052#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:01:09,118 INFO L290 TraceCheckUtils]: 338: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,118 INFO L290 TraceCheckUtils]: 337: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,118 INFO L290 TraceCheckUtils]: 336: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,119 INFO L290 TraceCheckUtils]: 335: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,119 INFO L290 TraceCheckUtils]: 334: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,119 INFO L290 TraceCheckUtils]: 333: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,119 INFO L290 TraceCheckUtils]: 332: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,120 INFO L290 TraceCheckUtils]: 331: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,120 INFO L290 TraceCheckUtils]: 330: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,120 INFO L290 TraceCheckUtils]: 329: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,120 INFO L290 TraceCheckUtils]: 328: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,121 INFO L290 TraceCheckUtils]: 327: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,121 INFO L290 TraceCheckUtils]: 326: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,121 INFO L290 TraceCheckUtils]: 325: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,121 INFO L290 TraceCheckUtils]: 324: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,122 INFO L290 TraceCheckUtils]: 323: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,122 INFO L290 TraceCheckUtils]: 322: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,122 INFO L290 TraceCheckUtils]: 321: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,122 INFO L290 TraceCheckUtils]: 320: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,123 INFO L290 TraceCheckUtils]: 319: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,123 INFO L290 TraceCheckUtils]: 318: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,123 INFO L290 TraceCheckUtils]: 317: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,123 INFO L290 TraceCheckUtils]: 316: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,124 INFO L290 TraceCheckUtils]: 315: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,124 INFO L290 TraceCheckUtils]: 314: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,124 INFO L290 TraceCheckUtils]: 313: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,124 INFO L290 TraceCheckUtils]: 312: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,124 INFO L290 TraceCheckUtils]: 311: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,125 INFO L290 TraceCheckUtils]: 310: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,125 INFO L290 TraceCheckUtils]: 309: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,125 INFO L290 TraceCheckUtils]: 308: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,125 INFO L290 TraceCheckUtils]: 307: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,126 INFO L290 TraceCheckUtils]: 306: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,126 INFO L290 TraceCheckUtils]: 305: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,126 INFO L290 TraceCheckUtils]: 304: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,126 INFO L290 TraceCheckUtils]: 303: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,127 INFO L290 TraceCheckUtils]: 302: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,127 INFO L290 TraceCheckUtils]: 301: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,127 INFO L290 TraceCheckUtils]: 300: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,127 INFO L290 TraceCheckUtils]: 299: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,128 INFO L290 TraceCheckUtils]: 298: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,128 INFO L290 TraceCheckUtils]: 297: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,128 INFO L290 TraceCheckUtils]: 296: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,128 INFO L290 TraceCheckUtils]: 295: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,128 INFO L290 TraceCheckUtils]: 294: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,129 INFO L290 TraceCheckUtils]: 293: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,129 INFO L290 TraceCheckUtils]: 292: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,129 INFO L290 TraceCheckUtils]: 291: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,129 INFO L290 TraceCheckUtils]: 290: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,130 INFO L290 TraceCheckUtils]: 289: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,130 INFO L290 TraceCheckUtils]: 288: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,130 INFO L290 TraceCheckUtils]: 287: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,130 INFO L290 TraceCheckUtils]: 286: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,131 INFO L290 TraceCheckUtils]: 285: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,131 INFO L290 TraceCheckUtils]: 284: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,131 INFO L290 TraceCheckUtils]: 283: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,131 INFO L290 TraceCheckUtils]: 282: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,132 INFO L290 TraceCheckUtils]: 281: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,132 INFO L290 TraceCheckUtils]: 280: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,132 INFO L290 TraceCheckUtils]: 279: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,132 INFO L290 TraceCheckUtils]: 278: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,132 INFO L290 TraceCheckUtils]: 277: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,133 INFO L290 TraceCheckUtils]: 276: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,133 INFO L290 TraceCheckUtils]: 275: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,133 INFO L290 TraceCheckUtils]: 274: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,133 INFO L290 TraceCheckUtils]: 273: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,134 INFO L290 TraceCheckUtils]: 272: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,134 INFO L290 TraceCheckUtils]: 271: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,134 INFO L290 TraceCheckUtils]: 270: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,134 INFO L290 TraceCheckUtils]: 269: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,135 INFO L290 TraceCheckUtils]: 268: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,135 INFO L290 TraceCheckUtils]: 267: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,135 INFO L290 TraceCheckUtils]: 266: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,135 INFO L290 TraceCheckUtils]: 265: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,136 INFO L290 TraceCheckUtils]: 264: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,136 INFO L290 TraceCheckUtils]: 263: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,136 INFO L290 TraceCheckUtils]: 262: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,136 INFO L290 TraceCheckUtils]: 261: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,137 INFO L290 TraceCheckUtils]: 260: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,137 INFO L290 TraceCheckUtils]: 259: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,137 INFO L290 TraceCheckUtils]: 258: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,137 INFO L290 TraceCheckUtils]: 257: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,137 INFO L290 TraceCheckUtils]: 256: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,138 INFO L290 TraceCheckUtils]: 255: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,138 INFO L290 TraceCheckUtils]: 254: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,138 INFO L290 TraceCheckUtils]: 253: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,138 INFO L290 TraceCheckUtils]: 252: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,139 INFO L290 TraceCheckUtils]: 251: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,139 INFO L290 TraceCheckUtils]: 250: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,139 INFO L290 TraceCheckUtils]: 249: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,139 INFO L290 TraceCheckUtils]: 248: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,140 INFO L290 TraceCheckUtils]: 247: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,140 INFO L290 TraceCheckUtils]: 246: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,140 INFO L290 TraceCheckUtils]: 245: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,140 INFO L290 TraceCheckUtils]: 244: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,141 INFO L290 TraceCheckUtils]: 243: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,141 INFO L290 TraceCheckUtils]: 242: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,141 INFO L290 TraceCheckUtils]: 241: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,141 INFO L290 TraceCheckUtils]: 240: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,141 INFO L290 TraceCheckUtils]: 239: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,142 INFO L290 TraceCheckUtils]: 238: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,142 INFO L290 TraceCheckUtils]: 237: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,142 INFO L290 TraceCheckUtils]: 236: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,142 INFO L290 TraceCheckUtils]: 235: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,143 INFO L290 TraceCheckUtils]: 234: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,143 INFO L290 TraceCheckUtils]: 233: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,143 INFO L290 TraceCheckUtils]: 232: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,143 INFO L290 TraceCheckUtils]: 231: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,144 INFO L290 TraceCheckUtils]: 230: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,144 INFO L290 TraceCheckUtils]: 229: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,144 INFO L290 TraceCheckUtils]: 228: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,144 INFO L290 TraceCheckUtils]: 227: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,145 INFO L290 TraceCheckUtils]: 226: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,145 INFO L290 TraceCheckUtils]: 225: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,145 INFO L290 TraceCheckUtils]: 224: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,145 INFO L290 TraceCheckUtils]: 223: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,145 INFO L290 TraceCheckUtils]: 222: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,146 INFO L290 TraceCheckUtils]: 221: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,146 INFO L290 TraceCheckUtils]: 220: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,146 INFO L290 TraceCheckUtils]: 219: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,146 INFO L290 TraceCheckUtils]: 218: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,147 INFO L290 TraceCheckUtils]: 217: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,147 INFO L290 TraceCheckUtils]: 216: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,147 INFO L290 TraceCheckUtils]: 215: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,147 INFO L290 TraceCheckUtils]: 214: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,148 INFO L290 TraceCheckUtils]: 213: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,148 INFO L290 TraceCheckUtils]: 212: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,148 INFO L290 TraceCheckUtils]: 211: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,148 INFO L290 TraceCheckUtils]: 210: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,149 INFO L290 TraceCheckUtils]: 209: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,149 INFO L290 TraceCheckUtils]: 208: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,149 INFO L290 TraceCheckUtils]: 207: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,149 INFO L290 TraceCheckUtils]: 206: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,149 INFO L290 TraceCheckUtils]: 205: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,150 INFO L290 TraceCheckUtils]: 204: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,150 INFO L290 TraceCheckUtils]: 203: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,150 INFO L290 TraceCheckUtils]: 202: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,150 INFO L290 TraceCheckUtils]: 201: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,151 INFO L290 TraceCheckUtils]: 200: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,151 INFO L290 TraceCheckUtils]: 199: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,151 INFO L290 TraceCheckUtils]: 198: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,151 INFO L290 TraceCheckUtils]: 197: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,152 INFO L290 TraceCheckUtils]: 196: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,152 INFO L290 TraceCheckUtils]: 195: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,152 INFO L290 TraceCheckUtils]: 194: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,152 INFO L290 TraceCheckUtils]: 193: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,153 INFO L290 TraceCheckUtils]: 192: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,153 INFO L290 TraceCheckUtils]: 191: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,153 INFO L290 TraceCheckUtils]: 190: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,153 INFO L290 TraceCheckUtils]: 189: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,154 INFO L290 TraceCheckUtils]: 188: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,154 INFO L290 TraceCheckUtils]: 187: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,154 INFO L290 TraceCheckUtils]: 186: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,154 INFO L290 TraceCheckUtils]: 185: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,154 INFO L290 TraceCheckUtils]: 184: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,155 INFO L290 TraceCheckUtils]: 183: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,155 INFO L290 TraceCheckUtils]: 182: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,155 INFO L290 TraceCheckUtils]: 181: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,155 INFO L290 TraceCheckUtils]: 180: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,156 INFO L290 TraceCheckUtils]: 179: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,156 INFO L290 TraceCheckUtils]: 178: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,156 INFO L290 TraceCheckUtils]: 177: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,156 INFO L290 TraceCheckUtils]: 176: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,157 INFO L290 TraceCheckUtils]: 175: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,157 INFO L290 TraceCheckUtils]: 174: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,157 INFO L290 TraceCheckUtils]: 173: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,157 INFO L290 TraceCheckUtils]: 172: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,158 INFO L290 TraceCheckUtils]: 171: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,158 INFO L290 TraceCheckUtils]: 170: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,158 INFO L290 TraceCheckUtils]: 169: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,158 INFO L290 TraceCheckUtils]: 168: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,158 INFO L290 TraceCheckUtils]: 167: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,159 INFO L290 TraceCheckUtils]: 166: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,159 INFO L290 TraceCheckUtils]: 165: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,159 INFO L290 TraceCheckUtils]: 164: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,159 INFO L290 TraceCheckUtils]: 163: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,160 INFO L290 TraceCheckUtils]: 162: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,160 INFO L290 TraceCheckUtils]: 161: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,160 INFO L290 TraceCheckUtils]: 160: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,160 INFO L290 TraceCheckUtils]: 159: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,161 INFO L290 TraceCheckUtils]: 158: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,161 INFO L290 TraceCheckUtils]: 157: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,161 INFO L290 TraceCheckUtils]: 156: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,161 INFO L290 TraceCheckUtils]: 155: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,162 INFO L290 TraceCheckUtils]: 154: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,162 INFO L290 TraceCheckUtils]: 153: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,162 INFO L290 TraceCheckUtils]: 152: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,162 INFO L290 TraceCheckUtils]: 151: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,162 INFO L290 TraceCheckUtils]: 150: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,163 INFO L290 TraceCheckUtils]: 149: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,163 INFO L290 TraceCheckUtils]: 148: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,163 INFO L290 TraceCheckUtils]: 147: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,163 INFO L290 TraceCheckUtils]: 146: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,164 INFO L290 TraceCheckUtils]: 145: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,164 INFO L290 TraceCheckUtils]: 144: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,164 INFO L290 TraceCheckUtils]: 143: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,164 INFO L290 TraceCheckUtils]: 142: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,165 INFO L290 TraceCheckUtils]: 141: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,165 INFO L290 TraceCheckUtils]: 140: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,165 INFO L290 TraceCheckUtils]: 139: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,165 INFO L290 TraceCheckUtils]: 138: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,166 INFO L290 TraceCheckUtils]: 137: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,166 INFO L290 TraceCheckUtils]: 136: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,166 INFO L290 TraceCheckUtils]: 135: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,166 INFO L290 TraceCheckUtils]: 134: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,166 INFO L290 TraceCheckUtils]: 133: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,167 INFO L290 TraceCheckUtils]: 132: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,167 INFO L290 TraceCheckUtils]: 131: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,167 INFO L290 TraceCheckUtils]: 130: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,167 INFO L290 TraceCheckUtils]: 129: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,168 INFO L290 TraceCheckUtils]: 128: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,168 INFO L290 TraceCheckUtils]: 127: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,168 INFO L290 TraceCheckUtils]: 126: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,168 INFO L290 TraceCheckUtils]: 125: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,169 INFO L290 TraceCheckUtils]: 124: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,169 INFO L290 TraceCheckUtils]: 123: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,169 INFO L290 TraceCheckUtils]: 122: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,169 INFO L290 TraceCheckUtils]: 121: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,170 INFO L290 TraceCheckUtils]: 120: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,170 INFO L290 TraceCheckUtils]: 119: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,170 INFO L290 TraceCheckUtils]: 118: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,170 INFO L290 TraceCheckUtils]: 117: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,170 INFO L290 TraceCheckUtils]: 116: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,171 INFO L290 TraceCheckUtils]: 115: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,171 INFO L290 TraceCheckUtils]: 114: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,171 INFO L290 TraceCheckUtils]: 113: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,171 INFO L290 TraceCheckUtils]: 112: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,172 INFO L290 TraceCheckUtils]: 111: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,172 INFO L290 TraceCheckUtils]: 110: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,172 INFO L290 TraceCheckUtils]: 109: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,172 INFO L290 TraceCheckUtils]: 108: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,173 INFO L290 TraceCheckUtils]: 107: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,173 INFO L290 TraceCheckUtils]: 106: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,173 INFO L290 TraceCheckUtils]: 105: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,173 INFO L290 TraceCheckUtils]: 104: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,174 INFO L290 TraceCheckUtils]: 103: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,174 INFO L290 TraceCheckUtils]: 102: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,174 INFO L290 TraceCheckUtils]: 101: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,174 INFO L290 TraceCheckUtils]: 100: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,175 INFO L290 TraceCheckUtils]: 99: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,175 INFO L290 TraceCheckUtils]: 98: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,175 INFO L290 TraceCheckUtils]: 97: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,175 INFO L290 TraceCheckUtils]: 96: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,176 INFO L290 TraceCheckUtils]: 95: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,176 INFO L290 TraceCheckUtils]: 94: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,176 INFO L290 TraceCheckUtils]: 93: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,176 INFO L290 TraceCheckUtils]: 92: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,176 INFO L290 TraceCheckUtils]: 91: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,177 INFO L290 TraceCheckUtils]: 90: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,177 INFO L290 TraceCheckUtils]: 89: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,177 INFO L290 TraceCheckUtils]: 88: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,177 INFO L290 TraceCheckUtils]: 87: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,178 INFO L290 TraceCheckUtils]: 86: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,178 INFO L290 TraceCheckUtils]: 85: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,178 INFO L290 TraceCheckUtils]: 84: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,178 INFO L290 TraceCheckUtils]: 83: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,179 INFO L290 TraceCheckUtils]: 82: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,179 INFO L290 TraceCheckUtils]: 81: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,179 INFO L290 TraceCheckUtils]: 80: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,179 INFO L290 TraceCheckUtils]: 79: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,180 INFO L290 TraceCheckUtils]: 78: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,180 INFO L290 TraceCheckUtils]: 77: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,180 INFO L290 TraceCheckUtils]: 76: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,180 INFO L290 TraceCheckUtils]: 75: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,180 INFO L290 TraceCheckUtils]: 74: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,181 INFO L290 TraceCheckUtils]: 73: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,181 INFO L290 TraceCheckUtils]: 72: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,181 INFO L290 TraceCheckUtils]: 71: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,181 INFO L290 TraceCheckUtils]: 70: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,184 INFO L290 TraceCheckUtils]: 60: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,186 INFO L290 TraceCheckUtils]: 52: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,186 INFO L290 TraceCheckUtils]: 51: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,187 INFO L290 TraceCheckUtils]: 47: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {50062#(< 4 main_~edgecount~0)} ~i~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {50062#(< 4 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {48906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 09:01:09,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-08 09:01:09,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-08 09:01:09,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-08 09:01:09,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {48906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-08 09:01:09,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48906#true} is VALID [2022-04-08 09:01:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15442 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:01:09,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522347973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:09,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:09,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-04-08 09:01:09,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:09,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [368189661] [2022-04-08 09:01:09,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [368189661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:09,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:09,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:01:09,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382080010] [2022-04-08 09:01:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 359 [2022-04-08 09:01:09,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:09,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:09,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:09,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:01:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:09,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:01:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:01:09,225 INFO L87 Difference]: Start difference. First operand 364 states and 473 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:11,467 INFO L93 Difference]: Finished difference Result 464 states and 600 transitions. [2022-04-08 09:01:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:01:11,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 359 [2022-04-08 09:01:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-04-08 09:01:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-04-08 09:01:11,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 138 transitions. [2022-04-08 09:01:11,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:11,584 INFO L225 Difference]: With dead ends: 464 [2022-04-08 09:01:11,584 INFO L226 Difference]: Without dead ends: 453 [2022-04-08 09:01:11,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2022-04-08 09:01:11,585 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 212 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:11,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 39 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:01:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-08 09:01:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 367. [2022-04-08 09:01:13,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:13,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:13,099 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:13,099 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:13,107 INFO L93 Difference]: Finished difference Result 453 states and 588 transitions. [2022-04-08 09:01:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 588 transitions. [2022-04-08 09:01:13,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:13,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:13,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 453 states. [2022-04-08 09:01:13,108 INFO L87 Difference]: Start difference. First operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 453 states. [2022-04-08 09:01:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:13,116 INFO L93 Difference]: Finished difference Result 453 states and 588 transitions. [2022-04-08 09:01:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 588 transitions. [2022-04-08 09:01:13,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:13,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:13,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:13,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 476 transitions. [2022-04-08 09:01:13,123 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 476 transitions. Word has length 359 [2022-04-08 09:01:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:13,123 INFO L478 AbstractCegarLoop]: Abstraction has 367 states and 476 transitions. [2022-04-08 09:01:13,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:13,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 367 states and 476 transitions. [2022-04-08 09:01:13,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 476 transitions. [2022-04-08 09:01:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-04-08 09:01:13,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:13,967 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:13,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-08 09:01:14,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:14,168 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:14,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash -121056614, now seen corresponding path program 61 times [2022-04-08 09:01:14,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:14,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [223181093] [2022-04-08 09:01:14,171 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:01:14,172 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:14,172 INFO L85 PathProgramCache]: Analyzing trace with hash -121056614, now seen corresponding path program 62 times [2022-04-08 09:01:14,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:14,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451911165] [2022-04-08 09:01:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:14,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:14,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {53674#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-08 09:01:14,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-08 09:01:14,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-08 09:01:14,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53674#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:14,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {53674#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-08 09:01:14,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-08 09:01:14,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-08 09:01:14,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-08 09:01:14,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,466 INFO L290 TraceCheckUtils]: 56: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,468 INFO L290 TraceCheckUtils]: 63: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,468 INFO L290 TraceCheckUtils]: 66: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,469 INFO L290 TraceCheckUtils]: 67: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,469 INFO L290 TraceCheckUtils]: 68: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,469 INFO L290 TraceCheckUtils]: 69: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,470 INFO L290 TraceCheckUtils]: 71: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,470 INFO L290 TraceCheckUtils]: 72: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,470 INFO L290 TraceCheckUtils]: 73: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,470 INFO L290 TraceCheckUtils]: 74: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,470 INFO L290 TraceCheckUtils]: 75: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,471 INFO L290 TraceCheckUtils]: 76: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,471 INFO L290 TraceCheckUtils]: 77: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,471 INFO L290 TraceCheckUtils]: 78: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,471 INFO L290 TraceCheckUtils]: 79: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,471 INFO L290 TraceCheckUtils]: 80: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,472 INFO L290 TraceCheckUtils]: 81: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,472 INFO L290 TraceCheckUtils]: 83: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,472 INFO L290 TraceCheckUtils]: 84: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,472 INFO L290 TraceCheckUtils]: 85: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,473 INFO L290 TraceCheckUtils]: 86: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,473 INFO L290 TraceCheckUtils]: 87: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,473 INFO L290 TraceCheckUtils]: 88: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,473 INFO L290 TraceCheckUtils]: 89: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,473 INFO L290 TraceCheckUtils]: 90: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,474 INFO L290 TraceCheckUtils]: 91: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,474 INFO L290 TraceCheckUtils]: 92: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,474 INFO L290 TraceCheckUtils]: 94: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,475 INFO L290 TraceCheckUtils]: 95: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,475 INFO L290 TraceCheckUtils]: 96: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,475 INFO L290 TraceCheckUtils]: 97: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,475 INFO L290 TraceCheckUtils]: 98: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,475 INFO L290 TraceCheckUtils]: 99: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,476 INFO L290 TraceCheckUtils]: 100: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,476 INFO L290 TraceCheckUtils]: 101: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,476 INFO L290 TraceCheckUtils]: 102: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,476 INFO L290 TraceCheckUtils]: 103: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,476 INFO L290 TraceCheckUtils]: 104: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,477 INFO L290 TraceCheckUtils]: 105: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,477 INFO L290 TraceCheckUtils]: 106: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,477 INFO L290 TraceCheckUtils]: 107: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,477 INFO L290 TraceCheckUtils]: 108: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,477 INFO L290 TraceCheckUtils]: 109: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,478 INFO L290 TraceCheckUtils]: 110: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,478 INFO L290 TraceCheckUtils]: 111: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,478 INFO L290 TraceCheckUtils]: 112: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,478 INFO L290 TraceCheckUtils]: 113: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,478 INFO L290 TraceCheckUtils]: 114: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,479 INFO L290 TraceCheckUtils]: 115: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,479 INFO L290 TraceCheckUtils]: 116: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,479 INFO L290 TraceCheckUtils]: 117: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,479 INFO L290 TraceCheckUtils]: 118: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,479 INFO L290 TraceCheckUtils]: 119: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,480 INFO L290 TraceCheckUtils]: 120: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,480 INFO L290 TraceCheckUtils]: 121: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,480 INFO L290 TraceCheckUtils]: 122: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,480 INFO L290 TraceCheckUtils]: 123: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,480 INFO L290 TraceCheckUtils]: 124: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,481 INFO L290 TraceCheckUtils]: 125: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,481 INFO L290 TraceCheckUtils]: 126: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,481 INFO L290 TraceCheckUtils]: 127: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,481 INFO L290 TraceCheckUtils]: 128: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,481 INFO L290 TraceCheckUtils]: 129: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,482 INFO L290 TraceCheckUtils]: 130: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,482 INFO L290 TraceCheckUtils]: 131: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,482 INFO L290 TraceCheckUtils]: 132: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,482 INFO L290 TraceCheckUtils]: 133: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,482 INFO L290 TraceCheckUtils]: 134: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,483 INFO L290 TraceCheckUtils]: 135: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,483 INFO L290 TraceCheckUtils]: 136: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,483 INFO L290 TraceCheckUtils]: 137: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,483 INFO L290 TraceCheckUtils]: 138: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,483 INFO L290 TraceCheckUtils]: 139: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,484 INFO L290 TraceCheckUtils]: 140: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,484 INFO L290 TraceCheckUtils]: 141: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,484 INFO L290 TraceCheckUtils]: 142: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,484 INFO L290 TraceCheckUtils]: 143: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,485 INFO L290 TraceCheckUtils]: 144: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,485 INFO L290 TraceCheckUtils]: 145: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,485 INFO L290 TraceCheckUtils]: 146: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,485 INFO L290 TraceCheckUtils]: 147: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,485 INFO L290 TraceCheckUtils]: 148: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,486 INFO L290 TraceCheckUtils]: 149: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,486 INFO L290 TraceCheckUtils]: 150: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,486 INFO L290 TraceCheckUtils]: 151: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,486 INFO L290 TraceCheckUtils]: 152: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,486 INFO L290 TraceCheckUtils]: 153: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,487 INFO L290 TraceCheckUtils]: 154: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,487 INFO L290 TraceCheckUtils]: 155: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,487 INFO L290 TraceCheckUtils]: 156: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,487 INFO L290 TraceCheckUtils]: 157: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,487 INFO L290 TraceCheckUtils]: 158: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,488 INFO L290 TraceCheckUtils]: 159: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,488 INFO L290 TraceCheckUtils]: 160: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,488 INFO L290 TraceCheckUtils]: 161: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,488 INFO L290 TraceCheckUtils]: 162: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,488 INFO L290 TraceCheckUtils]: 163: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,489 INFO L290 TraceCheckUtils]: 164: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,489 INFO L290 TraceCheckUtils]: 165: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,489 INFO L290 TraceCheckUtils]: 166: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,489 INFO L290 TraceCheckUtils]: 167: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,489 INFO L290 TraceCheckUtils]: 168: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,490 INFO L290 TraceCheckUtils]: 169: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,490 INFO L290 TraceCheckUtils]: 170: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,490 INFO L290 TraceCheckUtils]: 171: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,490 INFO L290 TraceCheckUtils]: 172: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,490 INFO L290 TraceCheckUtils]: 173: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,491 INFO L290 TraceCheckUtils]: 174: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,491 INFO L290 TraceCheckUtils]: 175: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,491 INFO L290 TraceCheckUtils]: 176: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,491 INFO L290 TraceCheckUtils]: 177: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,491 INFO L290 TraceCheckUtils]: 178: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,492 INFO L290 TraceCheckUtils]: 179: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,492 INFO L290 TraceCheckUtils]: 180: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,492 INFO L290 TraceCheckUtils]: 181: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,492 INFO L290 TraceCheckUtils]: 182: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,492 INFO L290 TraceCheckUtils]: 183: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,493 INFO L290 TraceCheckUtils]: 184: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,493 INFO L290 TraceCheckUtils]: 185: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,493 INFO L290 TraceCheckUtils]: 186: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,493 INFO L290 TraceCheckUtils]: 187: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,494 INFO L290 TraceCheckUtils]: 188: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,494 INFO L290 TraceCheckUtils]: 189: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,494 INFO L290 TraceCheckUtils]: 190: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,494 INFO L290 TraceCheckUtils]: 191: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,494 INFO L290 TraceCheckUtils]: 192: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,495 INFO L290 TraceCheckUtils]: 193: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,495 INFO L290 TraceCheckUtils]: 194: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,495 INFO L290 TraceCheckUtils]: 195: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,495 INFO L290 TraceCheckUtils]: 196: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,495 INFO L290 TraceCheckUtils]: 197: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,496 INFO L290 TraceCheckUtils]: 198: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,496 INFO L290 TraceCheckUtils]: 199: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,496 INFO L290 TraceCheckUtils]: 200: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,496 INFO L290 TraceCheckUtils]: 201: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,496 INFO L290 TraceCheckUtils]: 202: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,497 INFO L290 TraceCheckUtils]: 203: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,497 INFO L290 TraceCheckUtils]: 204: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,497 INFO L290 TraceCheckUtils]: 205: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,497 INFO L290 TraceCheckUtils]: 206: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,497 INFO L290 TraceCheckUtils]: 207: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,498 INFO L290 TraceCheckUtils]: 208: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,498 INFO L290 TraceCheckUtils]: 209: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,498 INFO L290 TraceCheckUtils]: 210: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,498 INFO L290 TraceCheckUtils]: 211: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,498 INFO L290 TraceCheckUtils]: 212: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,499 INFO L290 TraceCheckUtils]: 213: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,499 INFO L290 TraceCheckUtils]: 214: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,499 INFO L290 TraceCheckUtils]: 215: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,499 INFO L290 TraceCheckUtils]: 216: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,499 INFO L290 TraceCheckUtils]: 217: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,500 INFO L290 TraceCheckUtils]: 218: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,500 INFO L290 TraceCheckUtils]: 219: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,500 INFO L290 TraceCheckUtils]: 220: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,500 INFO L290 TraceCheckUtils]: 221: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,500 INFO L290 TraceCheckUtils]: 222: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,501 INFO L290 TraceCheckUtils]: 223: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,501 INFO L290 TraceCheckUtils]: 224: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,501 INFO L290 TraceCheckUtils]: 225: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,501 INFO L290 TraceCheckUtils]: 226: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,501 INFO L290 TraceCheckUtils]: 227: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,502 INFO L290 TraceCheckUtils]: 228: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,502 INFO L290 TraceCheckUtils]: 229: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,502 INFO L290 TraceCheckUtils]: 230: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,502 INFO L290 TraceCheckUtils]: 231: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,503 INFO L290 TraceCheckUtils]: 232: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,503 INFO L290 TraceCheckUtils]: 233: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,503 INFO L290 TraceCheckUtils]: 234: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,503 INFO L290 TraceCheckUtils]: 235: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,503 INFO L290 TraceCheckUtils]: 236: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,504 INFO L290 TraceCheckUtils]: 237: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,504 INFO L290 TraceCheckUtils]: 238: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,504 INFO L290 TraceCheckUtils]: 239: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,504 INFO L290 TraceCheckUtils]: 240: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,505 INFO L290 TraceCheckUtils]: 241: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,505 INFO L290 TraceCheckUtils]: 242: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,505 INFO L290 TraceCheckUtils]: 243: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,505 INFO L290 TraceCheckUtils]: 244: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,505 INFO L290 TraceCheckUtils]: 245: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,506 INFO L290 TraceCheckUtils]: 246: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,506 INFO L290 TraceCheckUtils]: 247: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,506 INFO L290 TraceCheckUtils]: 248: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,506 INFO L290 TraceCheckUtils]: 249: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,506 INFO L290 TraceCheckUtils]: 250: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,507 INFO L290 TraceCheckUtils]: 251: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,507 INFO L290 TraceCheckUtils]: 252: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,507 INFO L290 TraceCheckUtils]: 253: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,507 INFO L290 TraceCheckUtils]: 254: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,508 INFO L290 TraceCheckUtils]: 255: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,508 INFO L290 TraceCheckUtils]: 256: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,508 INFO L290 TraceCheckUtils]: 257: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,508 INFO L290 TraceCheckUtils]: 258: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,508 INFO L290 TraceCheckUtils]: 259: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,509 INFO L290 TraceCheckUtils]: 260: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,509 INFO L290 TraceCheckUtils]: 261: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,509 INFO L290 TraceCheckUtils]: 262: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,509 INFO L290 TraceCheckUtils]: 263: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,510 INFO L290 TraceCheckUtils]: 264: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,510 INFO L290 TraceCheckUtils]: 265: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,510 INFO L290 TraceCheckUtils]: 266: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,510 INFO L290 TraceCheckUtils]: 267: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,510 INFO L290 TraceCheckUtils]: 268: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,511 INFO L290 TraceCheckUtils]: 269: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,511 INFO L290 TraceCheckUtils]: 270: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,511 INFO L290 TraceCheckUtils]: 271: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,511 INFO L290 TraceCheckUtils]: 272: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,511 INFO L290 TraceCheckUtils]: 273: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,512 INFO L290 TraceCheckUtils]: 274: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,512 INFO L290 TraceCheckUtils]: 275: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,512 INFO L290 TraceCheckUtils]: 276: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,512 INFO L290 TraceCheckUtils]: 277: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,512 INFO L290 TraceCheckUtils]: 278: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,513 INFO L290 TraceCheckUtils]: 279: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,513 INFO L290 TraceCheckUtils]: 280: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,513 INFO L290 TraceCheckUtils]: 281: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,513 INFO L290 TraceCheckUtils]: 282: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,513 INFO L290 TraceCheckUtils]: 283: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,514 INFO L290 TraceCheckUtils]: 284: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,514 INFO L290 TraceCheckUtils]: 285: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,514 INFO L290 TraceCheckUtils]: 286: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,514 INFO L290 TraceCheckUtils]: 287: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,515 INFO L290 TraceCheckUtils]: 288: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,515 INFO L290 TraceCheckUtils]: 289: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,515 INFO L290 TraceCheckUtils]: 290: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,515 INFO L290 TraceCheckUtils]: 291: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,515 INFO L290 TraceCheckUtils]: 292: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,516 INFO L290 TraceCheckUtils]: 293: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,516 INFO L290 TraceCheckUtils]: 294: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,516 INFO L290 TraceCheckUtils]: 295: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,516 INFO L290 TraceCheckUtils]: 296: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,516 INFO L290 TraceCheckUtils]: 297: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,517 INFO L290 TraceCheckUtils]: 298: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,517 INFO L290 TraceCheckUtils]: 299: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,517 INFO L290 TraceCheckUtils]: 300: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,517 INFO L290 TraceCheckUtils]: 301: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,517 INFO L290 TraceCheckUtils]: 302: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,518 INFO L290 TraceCheckUtils]: 303: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,518 INFO L290 TraceCheckUtils]: 304: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,518 INFO L290 TraceCheckUtils]: 305: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,518 INFO L290 TraceCheckUtils]: 306: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,519 INFO L290 TraceCheckUtils]: 307: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,519 INFO L290 TraceCheckUtils]: 308: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,519 INFO L290 TraceCheckUtils]: 309: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,519 INFO L290 TraceCheckUtils]: 310: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,520 INFO L290 TraceCheckUtils]: 311: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,520 INFO L290 TraceCheckUtils]: 312: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,520 INFO L290 TraceCheckUtils]: 313: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,520 INFO L290 TraceCheckUtils]: 314: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,520 INFO L290 TraceCheckUtils]: 315: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,521 INFO L290 TraceCheckUtils]: 316: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,521 INFO L290 TraceCheckUtils]: 317: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,521 INFO L290 TraceCheckUtils]: 318: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,521 INFO L290 TraceCheckUtils]: 319: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,521 INFO L290 TraceCheckUtils]: 320: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,522 INFO L290 TraceCheckUtils]: 321: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,522 INFO L290 TraceCheckUtils]: 322: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,522 INFO L290 TraceCheckUtils]: 323: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,522 INFO L290 TraceCheckUtils]: 324: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,523 INFO L290 TraceCheckUtils]: 325: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,523 INFO L290 TraceCheckUtils]: 326: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,523 INFO L290 TraceCheckUtils]: 327: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,523 INFO L290 TraceCheckUtils]: 328: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,523 INFO L290 TraceCheckUtils]: 329: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,524 INFO L290 TraceCheckUtils]: 330: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,524 INFO L290 TraceCheckUtils]: 331: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,524 INFO L290 TraceCheckUtils]: 332: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,524 INFO L290 TraceCheckUtils]: 333: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,524 INFO L290 TraceCheckUtils]: 334: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,525 INFO L290 TraceCheckUtils]: 335: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,525 INFO L290 TraceCheckUtils]: 336: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,525 INFO L290 TraceCheckUtils]: 337: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,525 INFO L290 TraceCheckUtils]: 338: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:14,526 INFO L290 TraceCheckUtils]: 339: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:14,526 INFO L290 TraceCheckUtils]: 340: Hoare triple {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:14,526 INFO L290 TraceCheckUtils]: 341: Hoare triple {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:14,527 INFO L290 TraceCheckUtils]: 342: Hoare triple {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,527 INFO L290 TraceCheckUtils]: 343: Hoare triple {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,527 INFO L290 TraceCheckUtils]: 344: Hoare triple {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,528 INFO L290 TraceCheckUtils]: 345: Hoare triple {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,528 INFO L290 TraceCheckUtils]: 346: Hoare triple {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,528 INFO L290 TraceCheckUtils]: 347: Hoare triple {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,528 INFO L290 TraceCheckUtils]: 348: Hoare triple {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,529 INFO L290 TraceCheckUtils]: 349: Hoare triple {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,529 INFO L290 TraceCheckUtils]: 350: Hoare triple {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,529 INFO L290 TraceCheckUtils]: 351: Hoare triple {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,529 INFO L290 TraceCheckUtils]: 352: Hoare triple {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,530 INFO L290 TraceCheckUtils]: 353: Hoare triple {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,530 INFO L290 TraceCheckUtils]: 354: Hoare triple {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53673#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:01:14,530 INFO L290 TraceCheckUtils]: 355: Hoare triple {53673#(<= (+ main_~i~0 15) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {53663#false} is VALID [2022-04-08 09:01:14,530 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-08 09:01:14,530 INFO L290 TraceCheckUtils]: 357: Hoare triple {53663#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53663#false} is VALID [2022-04-08 09:01:14,530 INFO L272 TraceCheckUtils]: 358: Hoare triple {53663#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {53663#false} is VALID [2022-04-08 09:01:14,530 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-08 09:01:14,530 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-08 09:01:14,530 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-08 09:01:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15455 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:01:14,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:14,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451911165] [2022-04-08 09:01:14,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451911165] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:14,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688103956] [2022-04-08 09:01:14,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:01:14,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:14,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:14,535 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:01:14,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-08 09:01:15,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:01:15,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:15,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 2193 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:01:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:15,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:16,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53662#true} is VALID [2022-04-08 09:01:16,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-08 09:01:16,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-08 09:01:16,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-08 09:01:16,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-08 09:01:16,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,351 INFO L290 TraceCheckUtils]: 45: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,353 INFO L290 TraceCheckUtils]: 54: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,353 INFO L290 TraceCheckUtils]: 55: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,354 INFO L290 TraceCheckUtils]: 58: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,354 INFO L290 TraceCheckUtils]: 60: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,356 INFO L290 TraceCheckUtils]: 65: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,356 INFO L290 TraceCheckUtils]: 66: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,356 INFO L290 TraceCheckUtils]: 67: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,356 INFO L290 TraceCheckUtils]: 68: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,357 INFO L290 TraceCheckUtils]: 71: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,357 INFO L290 TraceCheckUtils]: 72: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,358 INFO L290 TraceCheckUtils]: 73: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,358 INFO L290 TraceCheckUtils]: 74: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,358 INFO L290 TraceCheckUtils]: 75: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,358 INFO L290 TraceCheckUtils]: 76: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,358 INFO L290 TraceCheckUtils]: 77: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,359 INFO L290 TraceCheckUtils]: 78: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,359 INFO L290 TraceCheckUtils]: 79: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,359 INFO L290 TraceCheckUtils]: 80: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,359 INFO L290 TraceCheckUtils]: 81: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,360 INFO L290 TraceCheckUtils]: 82: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,360 INFO L290 TraceCheckUtils]: 83: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,360 INFO L290 TraceCheckUtils]: 85: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,361 INFO L290 TraceCheckUtils]: 86: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,361 INFO L290 TraceCheckUtils]: 87: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,361 INFO L290 TraceCheckUtils]: 88: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,361 INFO L290 TraceCheckUtils]: 89: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,362 INFO L290 TraceCheckUtils]: 90: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,362 INFO L290 TraceCheckUtils]: 91: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,362 INFO L290 TraceCheckUtils]: 92: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,362 INFO L290 TraceCheckUtils]: 93: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,362 INFO L290 TraceCheckUtils]: 94: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,363 INFO L290 TraceCheckUtils]: 95: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,363 INFO L290 TraceCheckUtils]: 96: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,363 INFO L290 TraceCheckUtils]: 97: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,363 INFO L290 TraceCheckUtils]: 98: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,364 INFO L290 TraceCheckUtils]: 99: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,364 INFO L290 TraceCheckUtils]: 100: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,364 INFO L290 TraceCheckUtils]: 101: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,364 INFO L290 TraceCheckUtils]: 102: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,365 INFO L290 TraceCheckUtils]: 103: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,365 INFO L290 TraceCheckUtils]: 104: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,365 INFO L290 TraceCheckUtils]: 105: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,365 INFO L290 TraceCheckUtils]: 106: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,366 INFO L290 TraceCheckUtils]: 107: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,366 INFO L290 TraceCheckUtils]: 108: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,366 INFO L290 TraceCheckUtils]: 109: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,366 INFO L290 TraceCheckUtils]: 110: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,366 INFO L290 TraceCheckUtils]: 111: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,367 INFO L290 TraceCheckUtils]: 112: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,367 INFO L290 TraceCheckUtils]: 113: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,367 INFO L290 TraceCheckUtils]: 114: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,367 INFO L290 TraceCheckUtils]: 115: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,368 INFO L290 TraceCheckUtils]: 116: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,368 INFO L290 TraceCheckUtils]: 117: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,368 INFO L290 TraceCheckUtils]: 118: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,368 INFO L290 TraceCheckUtils]: 119: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,369 INFO L290 TraceCheckUtils]: 120: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,369 INFO L290 TraceCheckUtils]: 121: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,369 INFO L290 TraceCheckUtils]: 122: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,369 INFO L290 TraceCheckUtils]: 123: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,370 INFO L290 TraceCheckUtils]: 124: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,370 INFO L290 TraceCheckUtils]: 125: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,370 INFO L290 TraceCheckUtils]: 126: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,370 INFO L290 TraceCheckUtils]: 127: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,371 INFO L290 TraceCheckUtils]: 128: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,371 INFO L290 TraceCheckUtils]: 129: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,371 INFO L290 TraceCheckUtils]: 130: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,371 INFO L290 TraceCheckUtils]: 131: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,371 INFO L290 TraceCheckUtils]: 132: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,372 INFO L290 TraceCheckUtils]: 133: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,372 INFO L290 TraceCheckUtils]: 134: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,372 INFO L290 TraceCheckUtils]: 135: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,372 INFO L290 TraceCheckUtils]: 136: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,373 INFO L290 TraceCheckUtils]: 137: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,373 INFO L290 TraceCheckUtils]: 138: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,373 INFO L290 TraceCheckUtils]: 139: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,373 INFO L290 TraceCheckUtils]: 140: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,374 INFO L290 TraceCheckUtils]: 141: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,374 INFO L290 TraceCheckUtils]: 142: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,374 INFO L290 TraceCheckUtils]: 143: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,374 INFO L290 TraceCheckUtils]: 144: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,375 INFO L290 TraceCheckUtils]: 145: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,375 INFO L290 TraceCheckUtils]: 146: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,375 INFO L290 TraceCheckUtils]: 147: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,375 INFO L290 TraceCheckUtils]: 148: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,376 INFO L290 TraceCheckUtils]: 149: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,376 INFO L290 TraceCheckUtils]: 150: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,376 INFO L290 TraceCheckUtils]: 151: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,376 INFO L290 TraceCheckUtils]: 152: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,377 INFO L290 TraceCheckUtils]: 153: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,377 INFO L290 TraceCheckUtils]: 154: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,377 INFO L290 TraceCheckUtils]: 155: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,377 INFO L290 TraceCheckUtils]: 156: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,377 INFO L290 TraceCheckUtils]: 157: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,378 INFO L290 TraceCheckUtils]: 158: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,378 INFO L290 TraceCheckUtils]: 159: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,378 INFO L290 TraceCheckUtils]: 160: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,378 INFO L290 TraceCheckUtils]: 161: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,379 INFO L290 TraceCheckUtils]: 162: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,379 INFO L290 TraceCheckUtils]: 163: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,379 INFO L290 TraceCheckUtils]: 164: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,379 INFO L290 TraceCheckUtils]: 165: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,380 INFO L290 TraceCheckUtils]: 166: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,380 INFO L290 TraceCheckUtils]: 167: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,380 INFO L290 TraceCheckUtils]: 168: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,380 INFO L290 TraceCheckUtils]: 169: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,381 INFO L290 TraceCheckUtils]: 170: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,381 INFO L290 TraceCheckUtils]: 171: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,381 INFO L290 TraceCheckUtils]: 172: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,381 INFO L290 TraceCheckUtils]: 173: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,382 INFO L290 TraceCheckUtils]: 174: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,382 INFO L290 TraceCheckUtils]: 175: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,382 INFO L290 TraceCheckUtils]: 176: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,382 INFO L290 TraceCheckUtils]: 177: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,382 INFO L290 TraceCheckUtils]: 178: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,383 INFO L290 TraceCheckUtils]: 179: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,383 INFO L290 TraceCheckUtils]: 180: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,383 INFO L290 TraceCheckUtils]: 181: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,383 INFO L290 TraceCheckUtils]: 182: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,384 INFO L290 TraceCheckUtils]: 183: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,384 INFO L290 TraceCheckUtils]: 184: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,384 INFO L290 TraceCheckUtils]: 185: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,384 INFO L290 TraceCheckUtils]: 186: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,385 INFO L290 TraceCheckUtils]: 187: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,385 INFO L290 TraceCheckUtils]: 188: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,385 INFO L290 TraceCheckUtils]: 189: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,385 INFO L290 TraceCheckUtils]: 190: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,385 INFO L290 TraceCheckUtils]: 191: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,386 INFO L290 TraceCheckUtils]: 192: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,386 INFO L290 TraceCheckUtils]: 193: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,386 INFO L290 TraceCheckUtils]: 194: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,386 INFO L290 TraceCheckUtils]: 195: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,387 INFO L290 TraceCheckUtils]: 196: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,387 INFO L290 TraceCheckUtils]: 197: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,387 INFO L290 TraceCheckUtils]: 198: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,387 INFO L290 TraceCheckUtils]: 199: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,388 INFO L290 TraceCheckUtils]: 200: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,388 INFO L290 TraceCheckUtils]: 201: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,388 INFO L290 TraceCheckUtils]: 202: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,388 INFO L290 TraceCheckUtils]: 203: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,388 INFO L290 TraceCheckUtils]: 204: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,389 INFO L290 TraceCheckUtils]: 205: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,389 INFO L290 TraceCheckUtils]: 206: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,389 INFO L290 TraceCheckUtils]: 207: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,389 INFO L290 TraceCheckUtils]: 208: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,390 INFO L290 TraceCheckUtils]: 209: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,390 INFO L290 TraceCheckUtils]: 210: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,390 INFO L290 TraceCheckUtils]: 211: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,390 INFO L290 TraceCheckUtils]: 212: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,391 INFO L290 TraceCheckUtils]: 213: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,391 INFO L290 TraceCheckUtils]: 214: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,391 INFO L290 TraceCheckUtils]: 215: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,391 INFO L290 TraceCheckUtils]: 216: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,392 INFO L290 TraceCheckUtils]: 217: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,392 INFO L290 TraceCheckUtils]: 218: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,392 INFO L290 TraceCheckUtils]: 219: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,392 INFO L290 TraceCheckUtils]: 220: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,392 INFO L290 TraceCheckUtils]: 221: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,393 INFO L290 TraceCheckUtils]: 222: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,393 INFO L290 TraceCheckUtils]: 223: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,393 INFO L290 TraceCheckUtils]: 224: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,393 INFO L290 TraceCheckUtils]: 225: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,394 INFO L290 TraceCheckUtils]: 226: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,394 INFO L290 TraceCheckUtils]: 227: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,394 INFO L290 TraceCheckUtils]: 228: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,394 INFO L290 TraceCheckUtils]: 229: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,394 INFO L290 TraceCheckUtils]: 230: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,395 INFO L290 TraceCheckUtils]: 231: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,395 INFO L290 TraceCheckUtils]: 232: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,395 INFO L290 TraceCheckUtils]: 233: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,395 INFO L290 TraceCheckUtils]: 234: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,396 INFO L290 TraceCheckUtils]: 235: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,396 INFO L290 TraceCheckUtils]: 236: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,396 INFO L290 TraceCheckUtils]: 237: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,396 INFO L290 TraceCheckUtils]: 238: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,397 INFO L290 TraceCheckUtils]: 239: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,397 INFO L290 TraceCheckUtils]: 240: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,397 INFO L290 TraceCheckUtils]: 241: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,397 INFO L290 TraceCheckUtils]: 242: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,398 INFO L290 TraceCheckUtils]: 243: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,398 INFO L290 TraceCheckUtils]: 244: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,398 INFO L290 TraceCheckUtils]: 245: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,398 INFO L290 TraceCheckUtils]: 246: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,398 INFO L290 TraceCheckUtils]: 247: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,399 INFO L290 TraceCheckUtils]: 248: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,399 INFO L290 TraceCheckUtils]: 249: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,399 INFO L290 TraceCheckUtils]: 250: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,399 INFO L290 TraceCheckUtils]: 251: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,400 INFO L290 TraceCheckUtils]: 252: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,400 INFO L290 TraceCheckUtils]: 253: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,400 INFO L290 TraceCheckUtils]: 254: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,400 INFO L290 TraceCheckUtils]: 255: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,401 INFO L290 TraceCheckUtils]: 256: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,401 INFO L290 TraceCheckUtils]: 257: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,401 INFO L290 TraceCheckUtils]: 258: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,401 INFO L290 TraceCheckUtils]: 259: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,402 INFO L290 TraceCheckUtils]: 260: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,402 INFO L290 TraceCheckUtils]: 261: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,402 INFO L290 TraceCheckUtils]: 262: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,402 INFO L290 TraceCheckUtils]: 263: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,402 INFO L290 TraceCheckUtils]: 264: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,403 INFO L290 TraceCheckUtils]: 265: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,403 INFO L290 TraceCheckUtils]: 266: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,403 INFO L290 TraceCheckUtils]: 267: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,403 INFO L290 TraceCheckUtils]: 268: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,404 INFO L290 TraceCheckUtils]: 269: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,404 INFO L290 TraceCheckUtils]: 270: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,404 INFO L290 TraceCheckUtils]: 271: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,404 INFO L290 TraceCheckUtils]: 272: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,405 INFO L290 TraceCheckUtils]: 273: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,405 INFO L290 TraceCheckUtils]: 274: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,405 INFO L290 TraceCheckUtils]: 275: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,405 INFO L290 TraceCheckUtils]: 276: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,405 INFO L290 TraceCheckUtils]: 277: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,406 INFO L290 TraceCheckUtils]: 278: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,406 INFO L290 TraceCheckUtils]: 279: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,406 INFO L290 TraceCheckUtils]: 280: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,406 INFO L290 TraceCheckUtils]: 281: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,407 INFO L290 TraceCheckUtils]: 282: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,407 INFO L290 TraceCheckUtils]: 283: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,407 INFO L290 TraceCheckUtils]: 284: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,407 INFO L290 TraceCheckUtils]: 285: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,408 INFO L290 TraceCheckUtils]: 286: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,408 INFO L290 TraceCheckUtils]: 287: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,408 INFO L290 TraceCheckUtils]: 288: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,408 INFO L290 TraceCheckUtils]: 289: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,409 INFO L290 TraceCheckUtils]: 290: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,409 INFO L290 TraceCheckUtils]: 291: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,409 INFO L290 TraceCheckUtils]: 292: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,409 INFO L290 TraceCheckUtils]: 293: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,409 INFO L290 TraceCheckUtils]: 294: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,410 INFO L290 TraceCheckUtils]: 295: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,410 INFO L290 TraceCheckUtils]: 296: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,410 INFO L290 TraceCheckUtils]: 297: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,410 INFO L290 TraceCheckUtils]: 298: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,411 INFO L290 TraceCheckUtils]: 299: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,411 INFO L290 TraceCheckUtils]: 300: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,411 INFO L290 TraceCheckUtils]: 301: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,411 INFO L290 TraceCheckUtils]: 302: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,412 INFO L290 TraceCheckUtils]: 303: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,412 INFO L290 TraceCheckUtils]: 304: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,412 INFO L290 TraceCheckUtils]: 305: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,412 INFO L290 TraceCheckUtils]: 306: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,413 INFO L290 TraceCheckUtils]: 307: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,413 INFO L290 TraceCheckUtils]: 308: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,413 INFO L290 TraceCheckUtils]: 309: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,413 INFO L290 TraceCheckUtils]: 310: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,413 INFO L290 TraceCheckUtils]: 311: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,414 INFO L290 TraceCheckUtils]: 312: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,414 INFO L290 TraceCheckUtils]: 313: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,414 INFO L290 TraceCheckUtils]: 314: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,414 INFO L290 TraceCheckUtils]: 315: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,415 INFO L290 TraceCheckUtils]: 316: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,415 INFO L290 TraceCheckUtils]: 317: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,415 INFO L290 TraceCheckUtils]: 318: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,415 INFO L290 TraceCheckUtils]: 319: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,416 INFO L290 TraceCheckUtils]: 320: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,416 INFO L290 TraceCheckUtils]: 321: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,416 INFO L290 TraceCheckUtils]: 322: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,416 INFO L290 TraceCheckUtils]: 323: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,416 INFO L290 TraceCheckUtils]: 324: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,417 INFO L290 TraceCheckUtils]: 325: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,417 INFO L290 TraceCheckUtils]: 326: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,417 INFO L290 TraceCheckUtils]: 327: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,418 INFO L290 TraceCheckUtils]: 328: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,418 INFO L290 TraceCheckUtils]: 329: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,418 INFO L290 TraceCheckUtils]: 330: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,418 INFO L290 TraceCheckUtils]: 331: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,419 INFO L290 TraceCheckUtils]: 332: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,419 INFO L290 TraceCheckUtils]: 333: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,419 INFO L290 TraceCheckUtils]: 334: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,419 INFO L290 TraceCheckUtils]: 335: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,419 INFO L290 TraceCheckUtils]: 336: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,420 INFO L290 TraceCheckUtils]: 337: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,420 INFO L290 TraceCheckUtils]: 338: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:16,420 INFO L290 TraceCheckUtils]: 339: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:16,421 INFO L290 TraceCheckUtils]: 340: Hoare triple {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:16,421 INFO L290 TraceCheckUtils]: 341: Hoare triple {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:16,421 INFO L290 TraceCheckUtils]: 342: Hoare triple {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:16,422 INFO L290 TraceCheckUtils]: 343: Hoare triple {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:16,422 INFO L290 TraceCheckUtils]: 344: Hoare triple {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:16,423 INFO L290 TraceCheckUtils]: 345: Hoare triple {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:16,423 INFO L290 TraceCheckUtils]: 346: Hoare triple {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:16,423 INFO L290 TraceCheckUtils]: 347: Hoare triple {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:16,424 INFO L290 TraceCheckUtils]: 348: Hoare triple {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:16,424 INFO L290 TraceCheckUtils]: 349: Hoare triple {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:16,424 INFO L290 TraceCheckUtils]: 350: Hoare triple {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:16,425 INFO L290 TraceCheckUtils]: 351: Hoare triple {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 09:01:16,425 INFO L290 TraceCheckUtils]: 352: Hoare triple {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 09:01:16,425 INFO L290 TraceCheckUtils]: 353: Hoare triple {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 09:01:16,426 INFO L290 TraceCheckUtils]: 354: Hoare triple {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54745#(and (<= main_~i~0 5) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 09:01:16,426 INFO L290 TraceCheckUtils]: 355: Hoare triple {54745#(and (<= main_~i~0 5) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {53663#false} is VALID [2022-04-08 09:01:16,426 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-08 09:01:16,426 INFO L290 TraceCheckUtils]: 357: Hoare triple {53663#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53663#false} is VALID [2022-04-08 09:01:16,426 INFO L272 TraceCheckUtils]: 358: Hoare triple {53663#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {53663#false} is VALID [2022-04-08 09:01:16,426 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-08 09:01:16,426 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-08 09:01:16,426 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-08 09:01:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 15455 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:01:16,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:17,536 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-08 09:01:17,537 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-08 09:01:17,537 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-08 09:01:17,537 INFO L272 TraceCheckUtils]: 358: Hoare triple {53663#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {53663#false} is VALID [2022-04-08 09:01:17,537 INFO L290 TraceCheckUtils]: 357: Hoare triple {53663#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53663#false} is VALID [2022-04-08 09:01:17,537 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-08 09:01:17,537 INFO L290 TraceCheckUtils]: 355: Hoare triple {54785#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {53663#false} is VALID [2022-04-08 09:01:17,537 INFO L290 TraceCheckUtils]: 354: Hoare triple {54789#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54785#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,538 INFO L290 TraceCheckUtils]: 353: Hoare triple {54789#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54789#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,538 INFO L290 TraceCheckUtils]: 352: Hoare triple {54789#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54789#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,538 INFO L290 TraceCheckUtils]: 351: Hoare triple {54799#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54789#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,539 INFO L290 TraceCheckUtils]: 350: Hoare triple {54799#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54799#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,539 INFO L290 TraceCheckUtils]: 349: Hoare triple {54799#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54799#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,539 INFO L290 TraceCheckUtils]: 348: Hoare triple {54809#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54799#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,539 INFO L290 TraceCheckUtils]: 347: Hoare triple {54809#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54809#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,540 INFO L290 TraceCheckUtils]: 346: Hoare triple {54809#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54809#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,540 INFO L290 TraceCheckUtils]: 345: Hoare triple {54819#(< (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54809#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,540 INFO L290 TraceCheckUtils]: 344: Hoare triple {54819#(< (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54819#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,540 INFO L290 TraceCheckUtils]: 343: Hoare triple {54819#(< (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54819#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,541 INFO L290 TraceCheckUtils]: 342: Hoare triple {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54819#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,541 INFO L290 TraceCheckUtils]: 341: Hoare triple {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,542 INFO L290 TraceCheckUtils]: 340: Hoare triple {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,542 INFO L290 TraceCheckUtils]: 339: Hoare triple {54839#(< 5 main_~edgecount~0)} ~i~0 := 0; {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:17,542 INFO L290 TraceCheckUtils]: 338: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,542 INFO L290 TraceCheckUtils]: 337: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,543 INFO L290 TraceCheckUtils]: 336: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,543 INFO L290 TraceCheckUtils]: 335: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,543 INFO L290 TraceCheckUtils]: 334: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,543 INFO L290 TraceCheckUtils]: 333: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,543 INFO L290 TraceCheckUtils]: 332: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,544 INFO L290 TraceCheckUtils]: 331: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,544 INFO L290 TraceCheckUtils]: 330: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,544 INFO L290 TraceCheckUtils]: 329: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,544 INFO L290 TraceCheckUtils]: 328: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,545 INFO L290 TraceCheckUtils]: 327: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,545 INFO L290 TraceCheckUtils]: 326: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,545 INFO L290 TraceCheckUtils]: 325: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,545 INFO L290 TraceCheckUtils]: 324: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,546 INFO L290 TraceCheckUtils]: 323: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,546 INFO L290 TraceCheckUtils]: 322: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,546 INFO L290 TraceCheckUtils]: 321: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,546 INFO L290 TraceCheckUtils]: 320: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,546 INFO L290 TraceCheckUtils]: 319: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,547 INFO L290 TraceCheckUtils]: 318: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,547 INFO L290 TraceCheckUtils]: 317: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,547 INFO L290 TraceCheckUtils]: 316: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,547 INFO L290 TraceCheckUtils]: 315: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,548 INFO L290 TraceCheckUtils]: 314: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,548 INFO L290 TraceCheckUtils]: 313: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,548 INFO L290 TraceCheckUtils]: 312: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,548 INFO L290 TraceCheckUtils]: 311: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,549 INFO L290 TraceCheckUtils]: 310: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,549 INFO L290 TraceCheckUtils]: 309: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,549 INFO L290 TraceCheckUtils]: 308: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,549 INFO L290 TraceCheckUtils]: 307: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,549 INFO L290 TraceCheckUtils]: 306: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,550 INFO L290 TraceCheckUtils]: 305: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,550 INFO L290 TraceCheckUtils]: 304: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,550 INFO L290 TraceCheckUtils]: 303: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,550 INFO L290 TraceCheckUtils]: 302: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,551 INFO L290 TraceCheckUtils]: 301: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,551 INFO L290 TraceCheckUtils]: 300: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,551 INFO L290 TraceCheckUtils]: 299: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,551 INFO L290 TraceCheckUtils]: 298: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,552 INFO L290 TraceCheckUtils]: 297: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,552 INFO L290 TraceCheckUtils]: 296: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,552 INFO L290 TraceCheckUtils]: 295: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,552 INFO L290 TraceCheckUtils]: 294: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,553 INFO L290 TraceCheckUtils]: 293: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,553 INFO L290 TraceCheckUtils]: 292: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,553 INFO L290 TraceCheckUtils]: 291: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,553 INFO L290 TraceCheckUtils]: 290: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,553 INFO L290 TraceCheckUtils]: 289: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,554 INFO L290 TraceCheckUtils]: 288: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,554 INFO L290 TraceCheckUtils]: 287: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,554 INFO L290 TraceCheckUtils]: 286: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,554 INFO L290 TraceCheckUtils]: 285: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,555 INFO L290 TraceCheckUtils]: 284: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,555 INFO L290 TraceCheckUtils]: 283: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,555 INFO L290 TraceCheckUtils]: 282: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,555 INFO L290 TraceCheckUtils]: 281: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,556 INFO L290 TraceCheckUtils]: 280: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,556 INFO L290 TraceCheckUtils]: 279: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,556 INFO L290 TraceCheckUtils]: 278: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,556 INFO L290 TraceCheckUtils]: 277: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,556 INFO L290 TraceCheckUtils]: 276: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,557 INFO L290 TraceCheckUtils]: 275: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,557 INFO L290 TraceCheckUtils]: 274: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,557 INFO L290 TraceCheckUtils]: 273: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,557 INFO L290 TraceCheckUtils]: 272: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,558 INFO L290 TraceCheckUtils]: 271: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,558 INFO L290 TraceCheckUtils]: 270: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,558 INFO L290 TraceCheckUtils]: 269: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,558 INFO L290 TraceCheckUtils]: 268: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,559 INFO L290 TraceCheckUtils]: 267: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,559 INFO L290 TraceCheckUtils]: 266: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,559 INFO L290 TraceCheckUtils]: 265: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,559 INFO L290 TraceCheckUtils]: 264: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,559 INFO L290 TraceCheckUtils]: 263: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,560 INFO L290 TraceCheckUtils]: 262: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,560 INFO L290 TraceCheckUtils]: 261: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,560 INFO L290 TraceCheckUtils]: 260: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,560 INFO L290 TraceCheckUtils]: 259: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,561 INFO L290 TraceCheckUtils]: 258: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,561 INFO L290 TraceCheckUtils]: 257: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,561 INFO L290 TraceCheckUtils]: 256: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,561 INFO L290 TraceCheckUtils]: 255: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,562 INFO L290 TraceCheckUtils]: 254: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,562 INFO L290 TraceCheckUtils]: 253: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,562 INFO L290 TraceCheckUtils]: 252: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,562 INFO L290 TraceCheckUtils]: 251: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,562 INFO L290 TraceCheckUtils]: 250: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,563 INFO L290 TraceCheckUtils]: 249: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,563 INFO L290 TraceCheckUtils]: 248: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,563 INFO L290 TraceCheckUtils]: 247: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,563 INFO L290 TraceCheckUtils]: 246: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,564 INFO L290 TraceCheckUtils]: 245: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,564 INFO L290 TraceCheckUtils]: 244: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,564 INFO L290 TraceCheckUtils]: 243: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,564 INFO L290 TraceCheckUtils]: 242: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,565 INFO L290 TraceCheckUtils]: 241: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,565 INFO L290 TraceCheckUtils]: 240: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,565 INFO L290 TraceCheckUtils]: 239: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,565 INFO L290 TraceCheckUtils]: 238: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,566 INFO L290 TraceCheckUtils]: 237: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,566 INFO L290 TraceCheckUtils]: 236: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,566 INFO L290 TraceCheckUtils]: 235: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,566 INFO L290 TraceCheckUtils]: 234: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,566 INFO L290 TraceCheckUtils]: 233: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,567 INFO L290 TraceCheckUtils]: 232: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,567 INFO L290 TraceCheckUtils]: 231: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,567 INFO L290 TraceCheckUtils]: 230: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,567 INFO L290 TraceCheckUtils]: 229: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,568 INFO L290 TraceCheckUtils]: 228: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,568 INFO L290 TraceCheckUtils]: 227: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,568 INFO L290 TraceCheckUtils]: 226: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,568 INFO L290 TraceCheckUtils]: 225: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,569 INFO L290 TraceCheckUtils]: 224: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,569 INFO L290 TraceCheckUtils]: 223: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,569 INFO L290 TraceCheckUtils]: 222: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,569 INFO L290 TraceCheckUtils]: 221: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,570 INFO L290 TraceCheckUtils]: 220: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,570 INFO L290 TraceCheckUtils]: 219: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,570 INFO L290 TraceCheckUtils]: 218: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,570 INFO L290 TraceCheckUtils]: 217: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,570 INFO L290 TraceCheckUtils]: 216: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,571 INFO L290 TraceCheckUtils]: 215: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,571 INFO L290 TraceCheckUtils]: 214: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,571 INFO L290 TraceCheckUtils]: 213: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,571 INFO L290 TraceCheckUtils]: 212: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,572 INFO L290 TraceCheckUtils]: 211: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,572 INFO L290 TraceCheckUtils]: 210: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,572 INFO L290 TraceCheckUtils]: 209: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,572 INFO L290 TraceCheckUtils]: 208: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,573 INFO L290 TraceCheckUtils]: 207: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,573 INFO L290 TraceCheckUtils]: 206: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,573 INFO L290 TraceCheckUtils]: 205: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,573 INFO L290 TraceCheckUtils]: 204: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,574 INFO L290 TraceCheckUtils]: 203: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,574 INFO L290 TraceCheckUtils]: 202: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,574 INFO L290 TraceCheckUtils]: 201: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,574 INFO L290 TraceCheckUtils]: 200: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,574 INFO L290 TraceCheckUtils]: 199: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,575 INFO L290 TraceCheckUtils]: 198: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,575 INFO L290 TraceCheckUtils]: 197: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,575 INFO L290 TraceCheckUtils]: 196: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,575 INFO L290 TraceCheckUtils]: 195: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,576 INFO L290 TraceCheckUtils]: 194: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,576 INFO L290 TraceCheckUtils]: 193: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,576 INFO L290 TraceCheckUtils]: 192: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,576 INFO L290 TraceCheckUtils]: 191: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,577 INFO L290 TraceCheckUtils]: 190: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,577 INFO L290 TraceCheckUtils]: 189: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,577 INFO L290 TraceCheckUtils]: 188: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,577 INFO L290 TraceCheckUtils]: 187: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,578 INFO L290 TraceCheckUtils]: 186: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,578 INFO L290 TraceCheckUtils]: 185: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,578 INFO L290 TraceCheckUtils]: 184: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,578 INFO L290 TraceCheckUtils]: 183: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,578 INFO L290 TraceCheckUtils]: 182: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,579 INFO L290 TraceCheckUtils]: 181: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,579 INFO L290 TraceCheckUtils]: 180: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,579 INFO L290 TraceCheckUtils]: 179: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,579 INFO L290 TraceCheckUtils]: 178: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,580 INFO L290 TraceCheckUtils]: 177: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,580 INFO L290 TraceCheckUtils]: 176: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,580 INFO L290 TraceCheckUtils]: 175: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,580 INFO L290 TraceCheckUtils]: 174: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,581 INFO L290 TraceCheckUtils]: 173: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,581 INFO L290 TraceCheckUtils]: 172: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,581 INFO L290 TraceCheckUtils]: 171: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,581 INFO L290 TraceCheckUtils]: 170: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,581 INFO L290 TraceCheckUtils]: 169: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,582 INFO L290 TraceCheckUtils]: 168: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,582 INFO L290 TraceCheckUtils]: 167: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,582 INFO L290 TraceCheckUtils]: 166: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,582 INFO L290 TraceCheckUtils]: 165: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,583 INFO L290 TraceCheckUtils]: 164: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,583 INFO L290 TraceCheckUtils]: 163: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,583 INFO L290 TraceCheckUtils]: 162: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,583 INFO L290 TraceCheckUtils]: 161: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,584 INFO L290 TraceCheckUtils]: 160: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,584 INFO L290 TraceCheckUtils]: 159: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,584 INFO L290 TraceCheckUtils]: 158: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,584 INFO L290 TraceCheckUtils]: 157: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,584 INFO L290 TraceCheckUtils]: 156: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,585 INFO L290 TraceCheckUtils]: 155: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,585 INFO L290 TraceCheckUtils]: 154: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,585 INFO L290 TraceCheckUtils]: 153: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,585 INFO L290 TraceCheckUtils]: 152: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,586 INFO L290 TraceCheckUtils]: 151: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,586 INFO L290 TraceCheckUtils]: 150: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,586 INFO L290 TraceCheckUtils]: 149: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,586 INFO L290 TraceCheckUtils]: 148: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,587 INFO L290 TraceCheckUtils]: 147: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,587 INFO L290 TraceCheckUtils]: 146: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,587 INFO L290 TraceCheckUtils]: 145: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,587 INFO L290 TraceCheckUtils]: 144: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,587 INFO L290 TraceCheckUtils]: 143: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,588 INFO L290 TraceCheckUtils]: 142: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,588 INFO L290 TraceCheckUtils]: 141: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,588 INFO L290 TraceCheckUtils]: 140: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,588 INFO L290 TraceCheckUtils]: 139: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,589 INFO L290 TraceCheckUtils]: 138: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,589 INFO L290 TraceCheckUtils]: 137: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,589 INFO L290 TraceCheckUtils]: 136: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,589 INFO L290 TraceCheckUtils]: 135: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,590 INFO L290 TraceCheckUtils]: 134: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,590 INFO L290 TraceCheckUtils]: 133: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,590 INFO L290 TraceCheckUtils]: 132: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,590 INFO L290 TraceCheckUtils]: 131: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,590 INFO L290 TraceCheckUtils]: 130: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,591 INFO L290 TraceCheckUtils]: 129: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,591 INFO L290 TraceCheckUtils]: 128: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,591 INFO L290 TraceCheckUtils]: 127: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,591 INFO L290 TraceCheckUtils]: 126: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,592 INFO L290 TraceCheckUtils]: 125: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,592 INFO L290 TraceCheckUtils]: 124: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,592 INFO L290 TraceCheckUtils]: 123: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,592 INFO L290 TraceCheckUtils]: 122: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,593 INFO L290 TraceCheckUtils]: 121: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,593 INFO L290 TraceCheckUtils]: 120: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,593 INFO L290 TraceCheckUtils]: 119: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,593 INFO L290 TraceCheckUtils]: 118: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,594 INFO L290 TraceCheckUtils]: 117: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,594 INFO L290 TraceCheckUtils]: 116: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,594 INFO L290 TraceCheckUtils]: 115: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,594 INFO L290 TraceCheckUtils]: 114: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,594 INFO L290 TraceCheckUtils]: 113: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,595 INFO L290 TraceCheckUtils]: 112: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,595 INFO L290 TraceCheckUtils]: 111: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,595 INFO L290 TraceCheckUtils]: 110: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,596 INFO L290 TraceCheckUtils]: 109: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,596 INFO L290 TraceCheckUtils]: 108: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,596 INFO L290 TraceCheckUtils]: 107: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,596 INFO L290 TraceCheckUtils]: 106: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,597 INFO L290 TraceCheckUtils]: 105: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,597 INFO L290 TraceCheckUtils]: 104: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,597 INFO L290 TraceCheckUtils]: 103: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,597 INFO L290 TraceCheckUtils]: 102: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,598 INFO L290 TraceCheckUtils]: 101: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,598 INFO L290 TraceCheckUtils]: 100: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,598 INFO L290 TraceCheckUtils]: 99: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,598 INFO L290 TraceCheckUtils]: 98: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,598 INFO L290 TraceCheckUtils]: 97: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,599 INFO L290 TraceCheckUtils]: 96: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,599 INFO L290 TraceCheckUtils]: 95: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,599 INFO L290 TraceCheckUtils]: 94: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,599 INFO L290 TraceCheckUtils]: 93: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,600 INFO L290 TraceCheckUtils]: 92: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,600 INFO L290 TraceCheckUtils]: 91: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,600 INFO L290 TraceCheckUtils]: 90: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,600 INFO L290 TraceCheckUtils]: 89: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,601 INFO L290 TraceCheckUtils]: 88: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,601 INFO L290 TraceCheckUtils]: 87: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,601 INFO L290 TraceCheckUtils]: 86: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,601 INFO L290 TraceCheckUtils]: 85: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,601 INFO L290 TraceCheckUtils]: 84: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,602 INFO L290 TraceCheckUtils]: 83: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,602 INFO L290 TraceCheckUtils]: 82: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,602 INFO L290 TraceCheckUtils]: 81: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,602 INFO L290 TraceCheckUtils]: 80: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,603 INFO L290 TraceCheckUtils]: 79: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,603 INFO L290 TraceCheckUtils]: 78: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,603 INFO L290 TraceCheckUtils]: 77: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,603 INFO L290 TraceCheckUtils]: 76: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,604 INFO L290 TraceCheckUtils]: 74: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,604 INFO L290 TraceCheckUtils]: 73: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,604 INFO L290 TraceCheckUtils]: 72: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,604 INFO L290 TraceCheckUtils]: 71: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,605 INFO L290 TraceCheckUtils]: 70: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,605 INFO L290 TraceCheckUtils]: 69: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,605 INFO L290 TraceCheckUtils]: 68: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,605 INFO L290 TraceCheckUtils]: 67: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,606 INFO L290 TraceCheckUtils]: 66: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,606 INFO L290 TraceCheckUtils]: 65: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,606 INFO L290 TraceCheckUtils]: 63: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,607 INFO L290 TraceCheckUtils]: 59: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,609 INFO L290 TraceCheckUtils]: 53: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,609 INFO L290 TraceCheckUtils]: 52: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,627 INFO L290 TraceCheckUtils]: 50: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,627 INFO L290 TraceCheckUtils]: 48: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,629 INFO L290 TraceCheckUtils]: 44: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {54839#(< 5 main_~edgecount~0)} ~i~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {54839#(< 5 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 09:01:17,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-08 09:01:17,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-08 09:01:17,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-08 09:01:17,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-08 09:01:17,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53662#true} is VALID [2022-04-08 09:01:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15455 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:01:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688103956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:17,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-04-08 09:01:17,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [223181093] [2022-04-08 09:01:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [223181093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:17,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:01:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607732862] [2022-04-08 09:01:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:17,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 362 [2022-04-08 09:01:17,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:17,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:17,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:17,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:01:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:01:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=305, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:01:17,671 INFO L87 Difference]: Start difference. First operand 367 states and 476 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:20,500 INFO L93 Difference]: Finished difference Result 539 states and 699 transitions. [2022-04-08 09:01:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:01:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 362 [2022-04-08 09:01:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-04-08 09:01:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-04-08 09:01:20,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 160 transitions. [2022-04-08 09:01:20,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:20,630 INFO L225 Difference]: With dead ends: 539 [2022-04-08 09:01:20,630 INFO L226 Difference]: Without dead ends: 528 [2022-04-08 09:01:20,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=320, Invalid=550, Unknown=0, NotChecked=0, Total=870 [2022-04-08 09:01:20,631 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 242 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:20,631 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 47 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:01:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-04-08 09:01:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 370. [2022-04-08 09:01:22,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:22,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 528 states. Second operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:22,178 INFO L74 IsIncluded]: Start isIncluded. First operand 528 states. Second operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:22,178 INFO L87 Difference]: Start difference. First operand 528 states. Second operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:22,187 INFO L93 Difference]: Finished difference Result 528 states and 687 transitions. [2022-04-08 09:01:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 687 transitions. [2022-04-08 09:01:22,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:22,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:22,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 528 states. [2022-04-08 09:01:22,188 INFO L87 Difference]: Start difference. First operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 528 states. [2022-04-08 09:01:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:22,198 INFO L93 Difference]: Finished difference Result 528 states and 687 transitions. [2022-04-08 09:01:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 687 transitions. [2022-04-08 09:01:22,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:22,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:22,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:22,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 479 transitions. [2022-04-08 09:01:22,204 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 479 transitions. Word has length 362 [2022-04-08 09:01:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:22,204 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 479 transitions. [2022-04-08 09:01:22,205 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:22,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 370 states and 479 transitions. [2022-04-08 09:01:22,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 479 transitions. [2022-04-08 09:01:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2022-04-08 09:01:22,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:22,995 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 6, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:23,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-08 09:01:23,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-08 09:01:23,196 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:23,196 INFO L85 PathProgramCache]: Analyzing trace with hash 952532282, now seen corresponding path program 63 times [2022-04-08 09:01:23,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:23,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [502051711] [2022-04-08 09:01:23,199 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:01:23,199 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash 952532282, now seen corresponding path program 64 times [2022-04-08 09:01:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:23,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531415751] [2022-04-08 09:01:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:23,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:23,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {58760#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-08 09:01:23,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-08 09:01:23,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-08 09:01:23,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58760#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:23,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {58760#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-08 09:01:23,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-08 09:01:23,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-08 09:01:23,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-08 09:01:23,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {58747#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,525 INFO L290 TraceCheckUtils]: 47: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,525 INFO L290 TraceCheckUtils]: 48: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,525 INFO L290 TraceCheckUtils]: 50: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,527 INFO L290 TraceCheckUtils]: 59: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,528 INFO L290 TraceCheckUtils]: 61: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,528 INFO L290 TraceCheckUtils]: 63: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,528 INFO L290 TraceCheckUtils]: 64: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,530 INFO L290 TraceCheckUtils]: 69: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,530 INFO L290 TraceCheckUtils]: 70: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,531 INFO L290 TraceCheckUtils]: 77: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,531 INFO L290 TraceCheckUtils]: 78: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,532 INFO L290 TraceCheckUtils]: 79: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,532 INFO L290 TraceCheckUtils]: 80: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,532 INFO L290 TraceCheckUtils]: 81: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,532 INFO L290 TraceCheckUtils]: 82: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,533 INFO L290 TraceCheckUtils]: 83: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,533 INFO L290 TraceCheckUtils]: 84: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,533 INFO L290 TraceCheckUtils]: 85: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,533 INFO L290 TraceCheckUtils]: 86: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,533 INFO L290 TraceCheckUtils]: 87: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,534 INFO L290 TraceCheckUtils]: 88: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,534 INFO L290 TraceCheckUtils]: 89: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,534 INFO L290 TraceCheckUtils]: 90: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,534 INFO L290 TraceCheckUtils]: 91: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,535 INFO L290 TraceCheckUtils]: 92: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,535 INFO L290 TraceCheckUtils]: 93: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,535 INFO L290 TraceCheckUtils]: 94: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,535 INFO L290 TraceCheckUtils]: 95: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,535 INFO L290 TraceCheckUtils]: 96: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,536 INFO L290 TraceCheckUtils]: 97: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,536 INFO L290 TraceCheckUtils]: 98: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,536 INFO L290 TraceCheckUtils]: 99: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,536 INFO L290 TraceCheckUtils]: 100: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,536 INFO L290 TraceCheckUtils]: 101: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,537 INFO L290 TraceCheckUtils]: 102: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,537 INFO L290 TraceCheckUtils]: 103: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,537 INFO L290 TraceCheckUtils]: 104: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,537 INFO L290 TraceCheckUtils]: 105: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,538 INFO L290 TraceCheckUtils]: 106: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,538 INFO L290 TraceCheckUtils]: 107: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,538 INFO L290 TraceCheckUtils]: 108: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,538 INFO L290 TraceCheckUtils]: 109: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,538 INFO L290 TraceCheckUtils]: 110: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,539 INFO L290 TraceCheckUtils]: 111: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,539 INFO L290 TraceCheckUtils]: 112: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,539 INFO L290 TraceCheckUtils]: 113: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,539 INFO L290 TraceCheckUtils]: 114: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,539 INFO L290 TraceCheckUtils]: 115: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,540 INFO L290 TraceCheckUtils]: 116: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,540 INFO L290 TraceCheckUtils]: 117: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,540 INFO L290 TraceCheckUtils]: 118: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,540 INFO L290 TraceCheckUtils]: 119: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,541 INFO L290 TraceCheckUtils]: 120: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,541 INFO L290 TraceCheckUtils]: 121: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,541 INFO L290 TraceCheckUtils]: 122: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,541 INFO L290 TraceCheckUtils]: 123: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,541 INFO L290 TraceCheckUtils]: 124: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,542 INFO L290 TraceCheckUtils]: 125: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,542 INFO L290 TraceCheckUtils]: 126: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,542 INFO L290 TraceCheckUtils]: 127: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,542 INFO L290 TraceCheckUtils]: 128: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,542 INFO L290 TraceCheckUtils]: 129: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,543 INFO L290 TraceCheckUtils]: 130: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,543 INFO L290 TraceCheckUtils]: 131: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,543 INFO L290 TraceCheckUtils]: 132: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,543 INFO L290 TraceCheckUtils]: 133: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,543 INFO L290 TraceCheckUtils]: 134: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,544 INFO L290 TraceCheckUtils]: 135: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,544 INFO L290 TraceCheckUtils]: 136: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,544 INFO L290 TraceCheckUtils]: 137: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,544 INFO L290 TraceCheckUtils]: 138: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,544 INFO L290 TraceCheckUtils]: 139: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,545 INFO L290 TraceCheckUtils]: 140: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,545 INFO L290 TraceCheckUtils]: 141: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,545 INFO L290 TraceCheckUtils]: 142: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,545 INFO L290 TraceCheckUtils]: 143: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,545 INFO L290 TraceCheckUtils]: 144: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,546 INFO L290 TraceCheckUtils]: 145: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,546 INFO L290 TraceCheckUtils]: 146: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,546 INFO L290 TraceCheckUtils]: 147: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,546 INFO L290 TraceCheckUtils]: 148: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,546 INFO L290 TraceCheckUtils]: 149: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,547 INFO L290 TraceCheckUtils]: 150: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,547 INFO L290 TraceCheckUtils]: 151: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,547 INFO L290 TraceCheckUtils]: 152: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,547 INFO L290 TraceCheckUtils]: 153: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,547 INFO L290 TraceCheckUtils]: 154: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,548 INFO L290 TraceCheckUtils]: 155: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,548 INFO L290 TraceCheckUtils]: 156: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,548 INFO L290 TraceCheckUtils]: 157: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,548 INFO L290 TraceCheckUtils]: 158: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,548 INFO L290 TraceCheckUtils]: 159: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,549 INFO L290 TraceCheckUtils]: 160: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,549 INFO L290 TraceCheckUtils]: 161: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,549 INFO L290 TraceCheckUtils]: 162: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,549 INFO L290 TraceCheckUtils]: 163: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,550 INFO L290 TraceCheckUtils]: 164: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,550 INFO L290 TraceCheckUtils]: 165: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,550 INFO L290 TraceCheckUtils]: 166: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,550 INFO L290 TraceCheckUtils]: 167: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,550 INFO L290 TraceCheckUtils]: 168: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,551 INFO L290 TraceCheckUtils]: 169: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,551 INFO L290 TraceCheckUtils]: 170: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,551 INFO L290 TraceCheckUtils]: 171: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,551 INFO L290 TraceCheckUtils]: 172: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,551 INFO L290 TraceCheckUtils]: 173: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,552 INFO L290 TraceCheckUtils]: 174: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,552 INFO L290 TraceCheckUtils]: 175: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,552 INFO L290 TraceCheckUtils]: 176: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,552 INFO L290 TraceCheckUtils]: 177: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,552 INFO L290 TraceCheckUtils]: 178: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,553 INFO L290 TraceCheckUtils]: 179: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,553 INFO L290 TraceCheckUtils]: 180: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,553 INFO L290 TraceCheckUtils]: 181: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,553 INFO L290 TraceCheckUtils]: 182: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,553 INFO L290 TraceCheckUtils]: 183: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,554 INFO L290 TraceCheckUtils]: 184: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,554 INFO L290 TraceCheckUtils]: 185: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,554 INFO L290 TraceCheckUtils]: 186: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,554 INFO L290 TraceCheckUtils]: 187: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,554 INFO L290 TraceCheckUtils]: 188: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,555 INFO L290 TraceCheckUtils]: 189: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,555 INFO L290 TraceCheckUtils]: 190: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,555 INFO L290 TraceCheckUtils]: 191: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,555 INFO L290 TraceCheckUtils]: 192: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,556 INFO L290 TraceCheckUtils]: 193: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,556 INFO L290 TraceCheckUtils]: 194: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,556 INFO L290 TraceCheckUtils]: 195: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,556 INFO L290 TraceCheckUtils]: 196: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,556 INFO L290 TraceCheckUtils]: 197: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,557 INFO L290 TraceCheckUtils]: 198: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,557 INFO L290 TraceCheckUtils]: 199: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,557 INFO L290 TraceCheckUtils]: 200: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,557 INFO L290 TraceCheckUtils]: 201: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,557 INFO L290 TraceCheckUtils]: 202: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,558 INFO L290 TraceCheckUtils]: 203: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,558 INFO L290 TraceCheckUtils]: 204: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,558 INFO L290 TraceCheckUtils]: 205: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,558 INFO L290 TraceCheckUtils]: 206: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,558 INFO L290 TraceCheckUtils]: 207: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,559 INFO L290 TraceCheckUtils]: 208: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,559 INFO L290 TraceCheckUtils]: 209: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,559 INFO L290 TraceCheckUtils]: 210: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,559 INFO L290 TraceCheckUtils]: 211: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,559 INFO L290 TraceCheckUtils]: 212: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,560 INFO L290 TraceCheckUtils]: 213: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,560 INFO L290 TraceCheckUtils]: 214: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,560 INFO L290 TraceCheckUtils]: 215: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,560 INFO L290 TraceCheckUtils]: 216: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,560 INFO L290 TraceCheckUtils]: 217: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,561 INFO L290 TraceCheckUtils]: 218: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,561 INFO L290 TraceCheckUtils]: 219: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,561 INFO L290 TraceCheckUtils]: 220: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,561 INFO L290 TraceCheckUtils]: 221: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,561 INFO L290 TraceCheckUtils]: 222: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,562 INFO L290 TraceCheckUtils]: 223: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,562 INFO L290 TraceCheckUtils]: 224: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,562 INFO L290 TraceCheckUtils]: 225: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,562 INFO L290 TraceCheckUtils]: 226: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,562 INFO L290 TraceCheckUtils]: 227: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,563 INFO L290 TraceCheckUtils]: 228: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,563 INFO L290 TraceCheckUtils]: 229: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,563 INFO L290 TraceCheckUtils]: 230: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,563 INFO L290 TraceCheckUtils]: 231: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,563 INFO L290 TraceCheckUtils]: 232: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,564 INFO L290 TraceCheckUtils]: 233: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,564 INFO L290 TraceCheckUtils]: 234: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,564 INFO L290 TraceCheckUtils]: 235: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,564 INFO L290 TraceCheckUtils]: 236: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,564 INFO L290 TraceCheckUtils]: 237: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,565 INFO L290 TraceCheckUtils]: 238: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,565 INFO L290 TraceCheckUtils]: 239: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,565 INFO L290 TraceCheckUtils]: 240: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,565 INFO L290 TraceCheckUtils]: 241: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,565 INFO L290 TraceCheckUtils]: 242: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,566 INFO L290 TraceCheckUtils]: 243: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,566 INFO L290 TraceCheckUtils]: 244: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,566 INFO L290 TraceCheckUtils]: 245: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,566 INFO L290 TraceCheckUtils]: 246: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,566 INFO L290 TraceCheckUtils]: 247: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,567 INFO L290 TraceCheckUtils]: 248: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,567 INFO L290 TraceCheckUtils]: 249: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,567 INFO L290 TraceCheckUtils]: 250: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,567 INFO L290 TraceCheckUtils]: 251: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,568 INFO L290 TraceCheckUtils]: 252: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,568 INFO L290 TraceCheckUtils]: 253: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,568 INFO L290 TraceCheckUtils]: 254: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,568 INFO L290 TraceCheckUtils]: 255: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,568 INFO L290 TraceCheckUtils]: 256: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,569 INFO L290 TraceCheckUtils]: 257: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,569 INFO L290 TraceCheckUtils]: 258: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,569 INFO L290 TraceCheckUtils]: 259: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,569 INFO L290 TraceCheckUtils]: 260: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,569 INFO L290 TraceCheckUtils]: 261: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,570 INFO L290 TraceCheckUtils]: 262: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,570 INFO L290 TraceCheckUtils]: 263: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,570 INFO L290 TraceCheckUtils]: 264: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,570 INFO L290 TraceCheckUtils]: 265: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,570 INFO L290 TraceCheckUtils]: 266: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,571 INFO L290 TraceCheckUtils]: 267: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,571 INFO L290 TraceCheckUtils]: 268: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,571 INFO L290 TraceCheckUtils]: 269: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,571 INFO L290 TraceCheckUtils]: 270: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,571 INFO L290 TraceCheckUtils]: 271: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,572 INFO L290 TraceCheckUtils]: 272: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,572 INFO L290 TraceCheckUtils]: 273: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,572 INFO L290 TraceCheckUtils]: 274: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,572 INFO L290 TraceCheckUtils]: 275: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,573 INFO L290 TraceCheckUtils]: 276: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,573 INFO L290 TraceCheckUtils]: 277: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,573 INFO L290 TraceCheckUtils]: 278: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,573 INFO L290 TraceCheckUtils]: 279: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,574 INFO L290 TraceCheckUtils]: 280: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,574 INFO L290 TraceCheckUtils]: 281: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,574 INFO L290 TraceCheckUtils]: 282: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,574 INFO L290 TraceCheckUtils]: 283: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,574 INFO L290 TraceCheckUtils]: 284: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,575 INFO L290 TraceCheckUtils]: 285: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,575 INFO L290 TraceCheckUtils]: 286: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,575 INFO L290 TraceCheckUtils]: 287: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,575 INFO L290 TraceCheckUtils]: 288: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,575 INFO L290 TraceCheckUtils]: 289: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,576 INFO L290 TraceCheckUtils]: 290: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,576 INFO L290 TraceCheckUtils]: 291: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,576 INFO L290 TraceCheckUtils]: 292: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,576 INFO L290 TraceCheckUtils]: 293: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,576 INFO L290 TraceCheckUtils]: 294: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,577 INFO L290 TraceCheckUtils]: 295: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,577 INFO L290 TraceCheckUtils]: 296: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,577 INFO L290 TraceCheckUtils]: 297: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,577 INFO L290 TraceCheckUtils]: 298: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,577 INFO L290 TraceCheckUtils]: 299: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,578 INFO L290 TraceCheckUtils]: 300: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,578 INFO L290 TraceCheckUtils]: 301: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,578 INFO L290 TraceCheckUtils]: 302: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,578 INFO L290 TraceCheckUtils]: 303: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,579 INFO L290 TraceCheckUtils]: 304: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,579 INFO L290 TraceCheckUtils]: 305: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,579 INFO L290 TraceCheckUtils]: 306: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,579 INFO L290 TraceCheckUtils]: 307: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,580 INFO L290 TraceCheckUtils]: 308: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,580 INFO L290 TraceCheckUtils]: 309: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,580 INFO L290 TraceCheckUtils]: 310: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,580 INFO L290 TraceCheckUtils]: 311: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,580 INFO L290 TraceCheckUtils]: 312: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,581 INFO L290 TraceCheckUtils]: 313: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,581 INFO L290 TraceCheckUtils]: 314: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,581 INFO L290 TraceCheckUtils]: 315: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,581 INFO L290 TraceCheckUtils]: 316: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,582 INFO L290 TraceCheckUtils]: 317: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,582 INFO L290 TraceCheckUtils]: 318: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,582 INFO L290 TraceCheckUtils]: 319: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,582 INFO L290 TraceCheckUtils]: 320: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,583 INFO L290 TraceCheckUtils]: 321: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,583 INFO L290 TraceCheckUtils]: 322: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,583 INFO L290 TraceCheckUtils]: 323: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,583 INFO L290 TraceCheckUtils]: 324: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,583 INFO L290 TraceCheckUtils]: 325: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,584 INFO L290 TraceCheckUtils]: 326: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,584 INFO L290 TraceCheckUtils]: 327: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,584 INFO L290 TraceCheckUtils]: 328: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,584 INFO L290 TraceCheckUtils]: 329: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,585 INFO L290 TraceCheckUtils]: 330: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,585 INFO L290 TraceCheckUtils]: 331: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,585 INFO L290 TraceCheckUtils]: 332: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,585 INFO L290 TraceCheckUtils]: 333: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,586 INFO L290 TraceCheckUtils]: 334: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,586 INFO L290 TraceCheckUtils]: 335: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,586 INFO L290 TraceCheckUtils]: 336: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,586 INFO L290 TraceCheckUtils]: 337: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,586 INFO L290 TraceCheckUtils]: 338: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 09:01:23,587 INFO L290 TraceCheckUtils]: 339: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:23,587 INFO L290 TraceCheckUtils]: 340: Hoare triple {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:23,588 INFO L290 TraceCheckUtils]: 341: Hoare triple {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:23,588 INFO L290 TraceCheckUtils]: 342: Hoare triple {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:01:23,588 INFO L290 TraceCheckUtils]: 343: Hoare triple {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:01:23,589 INFO L290 TraceCheckUtils]: 344: Hoare triple {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:01:23,589 INFO L290 TraceCheckUtils]: 345: Hoare triple {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:23,589 INFO L290 TraceCheckUtils]: 346: Hoare triple {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:23,590 INFO L290 TraceCheckUtils]: 347: Hoare triple {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:23,590 INFO L290 TraceCheckUtils]: 348: Hoare triple {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:23,591 INFO L290 TraceCheckUtils]: 349: Hoare triple {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:23,591 INFO L290 TraceCheckUtils]: 350: Hoare triple {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:23,591 INFO L290 TraceCheckUtils]: 351: Hoare triple {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} is VALID [2022-04-08 09:01:23,592 INFO L290 TraceCheckUtils]: 352: Hoare triple {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} is VALID [2022-04-08 09:01:23,592 INFO L290 TraceCheckUtils]: 353: Hoare triple {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} is VALID [2022-04-08 09:01:23,592 INFO L290 TraceCheckUtils]: 354: Hoare triple {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:01:23,593 INFO L290 TraceCheckUtils]: 355: Hoare triple {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:01:23,593 INFO L290 TraceCheckUtils]: 356: Hoare triple {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 09:01:23,593 INFO L290 TraceCheckUtils]: 357: Hoare triple {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58759#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 6))} is VALID [2022-04-08 09:01:23,594 INFO L290 TraceCheckUtils]: 358: Hoare triple {58759#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 6))} assume !(~i~0 < ~edgecount~0); {58748#false} is VALID [2022-04-08 09:01:23,594 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-08 09:01:23,594 INFO L290 TraceCheckUtils]: 360: Hoare triple {58748#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58748#false} is VALID [2022-04-08 09:01:23,594 INFO L272 TraceCheckUtils]: 361: Hoare triple {58748#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {58748#false} is VALID [2022-04-08 09:01:23,594 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-08 09:01:23,594 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-08 09:01:23,594 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-08 09:01:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:01:23,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:23,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531415751] [2022-04-08 09:01:23,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531415751] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:23,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36058475] [2022-04-08 09:01:23,595 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:01:23,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:23,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:23,596 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:01:23,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-08 09:01:24,137 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:01:24,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:24,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 09:01:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:24,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:25,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58747#true} is VALID [2022-04-08 09:01:25,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {58747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-08 09:01:25,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {58747#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {58747#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {58747#true} assume !(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:25,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {58747#true} ~i~0 := 0; {58747#true} is VALID [2022-04-08 09:01:25,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 09:01:25,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {58833#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 09:01:25,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {58833#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 09:01:25,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {58833#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 09:01:25,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {58843#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 09:01:25,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {58843#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 09:01:25,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {58843#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 09:01:25,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {58853#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 09:01:25,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {58853#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 09:01:25,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {58853#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 09:01:25,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {58863#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 09:01:25,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {58863#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 09:01:25,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {58863#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 09:01:25,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {58873#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 09:01:25,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {58873#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 09:01:25,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {58873#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 09:01:25,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {58883#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 09:01:25,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {58883#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 09:01:25,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {58883#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58893#(<= 6 main_~j~0)} is VALID [2022-04-08 09:01:25,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {58893#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58893#(<= 6 main_~j~0)} is VALID [2022-04-08 09:01:25,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {58893#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58893#(<= 6 main_~j~0)} is VALID [2022-04-08 09:01:25,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {58893#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58903#(<= 7 main_~j~0)} is VALID [2022-04-08 09:01:25,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {58903#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58903#(<= 7 main_~j~0)} is VALID [2022-04-08 09:01:25,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {58903#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58903#(<= 7 main_~j~0)} is VALID [2022-04-08 09:01:25,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {58903#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58913#(<= 8 main_~j~0)} is VALID [2022-04-08 09:01:25,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {58913#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58913#(<= 8 main_~j~0)} is VALID [2022-04-08 09:01:25,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {58913#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58913#(<= 8 main_~j~0)} is VALID [2022-04-08 09:01:25,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {58913#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58923#(<= 9 main_~j~0)} is VALID [2022-04-08 09:01:25,658 INFO L290 TraceCheckUtils]: 51: Hoare triple {58923#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58923#(<= 9 main_~j~0)} is VALID [2022-04-08 09:01:25,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {58923#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58923#(<= 9 main_~j~0)} is VALID [2022-04-08 09:01:25,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {58923#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58933#(<= 10 main_~j~0)} is VALID [2022-04-08 09:01:25,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {58933#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58933#(<= 10 main_~j~0)} is VALID [2022-04-08 09:01:25,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {58933#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58933#(<= 10 main_~j~0)} is VALID [2022-04-08 09:01:25,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {58933#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58943#(<= 11 main_~j~0)} is VALID [2022-04-08 09:01:25,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {58943#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58943#(<= 11 main_~j~0)} is VALID [2022-04-08 09:01:25,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {58943#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58943#(<= 11 main_~j~0)} is VALID [2022-04-08 09:01:25,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {58943#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58953#(<= 12 main_~j~0)} is VALID [2022-04-08 09:01:25,661 INFO L290 TraceCheckUtils]: 60: Hoare triple {58953#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58953#(<= 12 main_~j~0)} is VALID [2022-04-08 09:01:25,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {58953#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58953#(<= 12 main_~j~0)} is VALID [2022-04-08 09:01:25,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {58953#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58963#(<= 13 main_~j~0)} is VALID [2022-04-08 09:01:25,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {58963#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58963#(<= 13 main_~j~0)} is VALID [2022-04-08 09:01:25,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {58963#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58963#(<= 13 main_~j~0)} is VALID [2022-04-08 09:01:25,662 INFO L290 TraceCheckUtils]: 65: Hoare triple {58963#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58973#(<= 14 main_~j~0)} is VALID [2022-04-08 09:01:25,662 INFO L290 TraceCheckUtils]: 66: Hoare triple {58973#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58973#(<= 14 main_~j~0)} is VALID [2022-04-08 09:01:25,662 INFO L290 TraceCheckUtils]: 67: Hoare triple {58973#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58973#(<= 14 main_~j~0)} is VALID [2022-04-08 09:01:25,663 INFO L290 TraceCheckUtils]: 68: Hoare triple {58973#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58983#(<= 15 main_~j~0)} is VALID [2022-04-08 09:01:25,663 INFO L290 TraceCheckUtils]: 69: Hoare triple {58983#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58983#(<= 15 main_~j~0)} is VALID [2022-04-08 09:01:25,663 INFO L290 TraceCheckUtils]: 70: Hoare triple {58983#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58983#(<= 15 main_~j~0)} is VALID [2022-04-08 09:01:25,664 INFO L290 TraceCheckUtils]: 71: Hoare triple {58983#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58993#(<= 16 main_~j~0)} is VALID [2022-04-08 09:01:25,664 INFO L290 TraceCheckUtils]: 72: Hoare triple {58993#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58993#(<= 16 main_~j~0)} is VALID [2022-04-08 09:01:25,664 INFO L290 TraceCheckUtils]: 73: Hoare triple {58993#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58993#(<= 16 main_~j~0)} is VALID [2022-04-08 09:01:25,664 INFO L290 TraceCheckUtils]: 74: Hoare triple {58993#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59003#(<= 17 main_~j~0)} is VALID [2022-04-08 09:01:25,665 INFO L290 TraceCheckUtils]: 75: Hoare triple {59003#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59003#(<= 17 main_~j~0)} is VALID [2022-04-08 09:01:25,665 INFO L290 TraceCheckUtils]: 76: Hoare triple {59003#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59003#(<= 17 main_~j~0)} is VALID [2022-04-08 09:01:25,665 INFO L290 TraceCheckUtils]: 77: Hoare triple {59003#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59013#(<= 18 main_~j~0)} is VALID [2022-04-08 09:01:25,665 INFO L290 TraceCheckUtils]: 78: Hoare triple {59013#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59013#(<= 18 main_~j~0)} is VALID [2022-04-08 09:01:25,666 INFO L290 TraceCheckUtils]: 79: Hoare triple {59013#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59013#(<= 18 main_~j~0)} is VALID [2022-04-08 09:01:25,666 INFO L290 TraceCheckUtils]: 80: Hoare triple {59013#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59023#(<= 19 main_~j~0)} is VALID [2022-04-08 09:01:25,666 INFO L290 TraceCheckUtils]: 81: Hoare triple {59023#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,667 INFO L290 TraceCheckUtils]: 82: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,667 INFO L290 TraceCheckUtils]: 83: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,667 INFO L290 TraceCheckUtils]: 84: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,667 INFO L290 TraceCheckUtils]: 85: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,668 INFO L290 TraceCheckUtils]: 86: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,668 INFO L290 TraceCheckUtils]: 87: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,668 INFO L290 TraceCheckUtils]: 88: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,668 INFO L290 TraceCheckUtils]: 89: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,669 INFO L290 TraceCheckUtils]: 90: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,669 INFO L290 TraceCheckUtils]: 91: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,669 INFO L290 TraceCheckUtils]: 92: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,669 INFO L290 TraceCheckUtils]: 93: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,669 INFO L290 TraceCheckUtils]: 94: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,670 INFO L290 TraceCheckUtils]: 95: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,670 INFO L290 TraceCheckUtils]: 96: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,670 INFO L290 TraceCheckUtils]: 97: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,670 INFO L290 TraceCheckUtils]: 98: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,671 INFO L290 TraceCheckUtils]: 99: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,671 INFO L290 TraceCheckUtils]: 100: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,671 INFO L290 TraceCheckUtils]: 101: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,671 INFO L290 TraceCheckUtils]: 102: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,672 INFO L290 TraceCheckUtils]: 103: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,672 INFO L290 TraceCheckUtils]: 104: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,672 INFO L290 TraceCheckUtils]: 105: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,672 INFO L290 TraceCheckUtils]: 106: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,672 INFO L290 TraceCheckUtils]: 107: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,673 INFO L290 TraceCheckUtils]: 108: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,673 INFO L290 TraceCheckUtils]: 109: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,673 INFO L290 TraceCheckUtils]: 110: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,673 INFO L290 TraceCheckUtils]: 111: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,674 INFO L290 TraceCheckUtils]: 112: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,674 INFO L290 TraceCheckUtils]: 113: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,674 INFO L290 TraceCheckUtils]: 114: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,674 INFO L290 TraceCheckUtils]: 115: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,675 INFO L290 TraceCheckUtils]: 116: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,675 INFO L290 TraceCheckUtils]: 117: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,675 INFO L290 TraceCheckUtils]: 118: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,675 INFO L290 TraceCheckUtils]: 119: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,675 INFO L290 TraceCheckUtils]: 120: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,676 INFO L290 TraceCheckUtils]: 121: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,676 INFO L290 TraceCheckUtils]: 122: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,676 INFO L290 TraceCheckUtils]: 123: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,676 INFO L290 TraceCheckUtils]: 124: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,677 INFO L290 TraceCheckUtils]: 125: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,677 INFO L290 TraceCheckUtils]: 126: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,677 INFO L290 TraceCheckUtils]: 127: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,677 INFO L290 TraceCheckUtils]: 128: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,678 INFO L290 TraceCheckUtils]: 129: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,678 INFO L290 TraceCheckUtils]: 130: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,678 INFO L290 TraceCheckUtils]: 131: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,678 INFO L290 TraceCheckUtils]: 132: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,678 INFO L290 TraceCheckUtils]: 133: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,679 INFO L290 TraceCheckUtils]: 134: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,679 INFO L290 TraceCheckUtils]: 135: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,679 INFO L290 TraceCheckUtils]: 136: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,679 INFO L290 TraceCheckUtils]: 137: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,680 INFO L290 TraceCheckUtils]: 138: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,680 INFO L290 TraceCheckUtils]: 139: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,680 INFO L290 TraceCheckUtils]: 140: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,680 INFO L290 TraceCheckUtils]: 141: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,681 INFO L290 TraceCheckUtils]: 142: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,681 INFO L290 TraceCheckUtils]: 143: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,681 INFO L290 TraceCheckUtils]: 144: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,681 INFO L290 TraceCheckUtils]: 145: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,681 INFO L290 TraceCheckUtils]: 146: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,682 INFO L290 TraceCheckUtils]: 147: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,682 INFO L290 TraceCheckUtils]: 148: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,682 INFO L290 TraceCheckUtils]: 149: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,682 INFO L290 TraceCheckUtils]: 150: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,683 INFO L290 TraceCheckUtils]: 151: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,683 INFO L290 TraceCheckUtils]: 152: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,683 INFO L290 TraceCheckUtils]: 153: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,683 INFO L290 TraceCheckUtils]: 154: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,683 INFO L290 TraceCheckUtils]: 155: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,684 INFO L290 TraceCheckUtils]: 156: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,684 INFO L290 TraceCheckUtils]: 157: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,684 INFO L290 TraceCheckUtils]: 158: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,684 INFO L290 TraceCheckUtils]: 159: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,685 INFO L290 TraceCheckUtils]: 160: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,685 INFO L290 TraceCheckUtils]: 161: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,685 INFO L290 TraceCheckUtils]: 162: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,685 INFO L290 TraceCheckUtils]: 163: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,686 INFO L290 TraceCheckUtils]: 164: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,686 INFO L290 TraceCheckUtils]: 165: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,686 INFO L290 TraceCheckUtils]: 166: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,686 INFO L290 TraceCheckUtils]: 167: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,686 INFO L290 TraceCheckUtils]: 168: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,687 INFO L290 TraceCheckUtils]: 169: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,687 INFO L290 TraceCheckUtils]: 170: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,687 INFO L290 TraceCheckUtils]: 171: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,687 INFO L290 TraceCheckUtils]: 172: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,688 INFO L290 TraceCheckUtils]: 173: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,688 INFO L290 TraceCheckUtils]: 174: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,688 INFO L290 TraceCheckUtils]: 175: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,688 INFO L290 TraceCheckUtils]: 176: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,689 INFO L290 TraceCheckUtils]: 177: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,689 INFO L290 TraceCheckUtils]: 178: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,689 INFO L290 TraceCheckUtils]: 179: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,689 INFO L290 TraceCheckUtils]: 180: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,690 INFO L290 TraceCheckUtils]: 181: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,690 INFO L290 TraceCheckUtils]: 182: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,690 INFO L290 TraceCheckUtils]: 183: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,690 INFO L290 TraceCheckUtils]: 184: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,691 INFO L290 TraceCheckUtils]: 185: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,691 INFO L290 TraceCheckUtils]: 186: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,691 INFO L290 TraceCheckUtils]: 187: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,691 INFO L290 TraceCheckUtils]: 188: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,691 INFO L290 TraceCheckUtils]: 189: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,692 INFO L290 TraceCheckUtils]: 190: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,692 INFO L290 TraceCheckUtils]: 191: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,692 INFO L290 TraceCheckUtils]: 192: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,692 INFO L290 TraceCheckUtils]: 193: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,693 INFO L290 TraceCheckUtils]: 194: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,693 INFO L290 TraceCheckUtils]: 195: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,693 INFO L290 TraceCheckUtils]: 196: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,693 INFO L290 TraceCheckUtils]: 197: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,694 INFO L290 TraceCheckUtils]: 198: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,694 INFO L290 TraceCheckUtils]: 199: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,694 INFO L290 TraceCheckUtils]: 200: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,694 INFO L290 TraceCheckUtils]: 201: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,695 INFO L290 TraceCheckUtils]: 202: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,695 INFO L290 TraceCheckUtils]: 203: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,695 INFO L290 TraceCheckUtils]: 204: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,695 INFO L290 TraceCheckUtils]: 205: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,696 INFO L290 TraceCheckUtils]: 206: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,696 INFO L290 TraceCheckUtils]: 207: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,696 INFO L290 TraceCheckUtils]: 208: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,696 INFO L290 TraceCheckUtils]: 209: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,696 INFO L290 TraceCheckUtils]: 210: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,697 INFO L290 TraceCheckUtils]: 211: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,697 INFO L290 TraceCheckUtils]: 212: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,697 INFO L290 TraceCheckUtils]: 213: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,697 INFO L290 TraceCheckUtils]: 214: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,698 INFO L290 TraceCheckUtils]: 215: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,698 INFO L290 TraceCheckUtils]: 216: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,698 INFO L290 TraceCheckUtils]: 217: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,698 INFO L290 TraceCheckUtils]: 218: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,699 INFO L290 TraceCheckUtils]: 219: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,699 INFO L290 TraceCheckUtils]: 220: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,699 INFO L290 TraceCheckUtils]: 221: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,699 INFO L290 TraceCheckUtils]: 222: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,700 INFO L290 TraceCheckUtils]: 223: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,700 INFO L290 TraceCheckUtils]: 224: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,700 INFO L290 TraceCheckUtils]: 225: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,700 INFO L290 TraceCheckUtils]: 226: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,700 INFO L290 TraceCheckUtils]: 227: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,701 INFO L290 TraceCheckUtils]: 228: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,701 INFO L290 TraceCheckUtils]: 229: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,701 INFO L290 TraceCheckUtils]: 230: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,701 INFO L290 TraceCheckUtils]: 231: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,702 INFO L290 TraceCheckUtils]: 232: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,702 INFO L290 TraceCheckUtils]: 233: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,702 INFO L290 TraceCheckUtils]: 234: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,702 INFO L290 TraceCheckUtils]: 235: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,703 INFO L290 TraceCheckUtils]: 236: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,703 INFO L290 TraceCheckUtils]: 237: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,703 INFO L290 TraceCheckUtils]: 238: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,703 INFO L290 TraceCheckUtils]: 239: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,703 INFO L290 TraceCheckUtils]: 240: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,704 INFO L290 TraceCheckUtils]: 241: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,704 INFO L290 TraceCheckUtils]: 242: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,704 INFO L290 TraceCheckUtils]: 243: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,704 INFO L290 TraceCheckUtils]: 244: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,705 INFO L290 TraceCheckUtils]: 245: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,705 INFO L290 TraceCheckUtils]: 246: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,705 INFO L290 TraceCheckUtils]: 247: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,705 INFO L290 TraceCheckUtils]: 248: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,706 INFO L290 TraceCheckUtils]: 249: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,706 INFO L290 TraceCheckUtils]: 250: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,706 INFO L290 TraceCheckUtils]: 251: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,706 INFO L290 TraceCheckUtils]: 252: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,706 INFO L290 TraceCheckUtils]: 253: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,707 INFO L290 TraceCheckUtils]: 254: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,707 INFO L290 TraceCheckUtils]: 255: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,707 INFO L290 TraceCheckUtils]: 256: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,707 INFO L290 TraceCheckUtils]: 257: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,708 INFO L290 TraceCheckUtils]: 258: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,708 INFO L290 TraceCheckUtils]: 259: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,708 INFO L290 TraceCheckUtils]: 260: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,708 INFO L290 TraceCheckUtils]: 261: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,709 INFO L290 TraceCheckUtils]: 262: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,709 INFO L290 TraceCheckUtils]: 263: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,709 INFO L290 TraceCheckUtils]: 264: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,709 INFO L290 TraceCheckUtils]: 265: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,709 INFO L290 TraceCheckUtils]: 266: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,710 INFO L290 TraceCheckUtils]: 267: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,710 INFO L290 TraceCheckUtils]: 268: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,710 INFO L290 TraceCheckUtils]: 269: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,710 INFO L290 TraceCheckUtils]: 270: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,711 INFO L290 TraceCheckUtils]: 271: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,711 INFO L290 TraceCheckUtils]: 272: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,711 INFO L290 TraceCheckUtils]: 273: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,711 INFO L290 TraceCheckUtils]: 274: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,711 INFO L290 TraceCheckUtils]: 275: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,712 INFO L290 TraceCheckUtils]: 276: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,712 INFO L290 TraceCheckUtils]: 277: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,712 INFO L290 TraceCheckUtils]: 278: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,712 INFO L290 TraceCheckUtils]: 279: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,713 INFO L290 TraceCheckUtils]: 280: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,713 INFO L290 TraceCheckUtils]: 281: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,713 INFO L290 TraceCheckUtils]: 282: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,713 INFO L290 TraceCheckUtils]: 283: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,714 INFO L290 TraceCheckUtils]: 284: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,714 INFO L290 TraceCheckUtils]: 285: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,714 INFO L290 TraceCheckUtils]: 286: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,714 INFO L290 TraceCheckUtils]: 287: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,714 INFO L290 TraceCheckUtils]: 288: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,715 INFO L290 TraceCheckUtils]: 289: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,715 INFO L290 TraceCheckUtils]: 290: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,715 INFO L290 TraceCheckUtils]: 291: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,715 INFO L290 TraceCheckUtils]: 292: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,716 INFO L290 TraceCheckUtils]: 293: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,716 INFO L290 TraceCheckUtils]: 294: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,716 INFO L290 TraceCheckUtils]: 295: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,716 INFO L290 TraceCheckUtils]: 296: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,717 INFO L290 TraceCheckUtils]: 297: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,717 INFO L290 TraceCheckUtils]: 298: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,717 INFO L290 TraceCheckUtils]: 299: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,717 INFO L290 TraceCheckUtils]: 300: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,717 INFO L290 TraceCheckUtils]: 301: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,718 INFO L290 TraceCheckUtils]: 302: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,718 INFO L290 TraceCheckUtils]: 303: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,718 INFO L290 TraceCheckUtils]: 304: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,718 INFO L290 TraceCheckUtils]: 305: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,719 INFO L290 TraceCheckUtils]: 306: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,719 INFO L290 TraceCheckUtils]: 307: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,719 INFO L290 TraceCheckUtils]: 308: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,719 INFO L290 TraceCheckUtils]: 309: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,720 INFO L290 TraceCheckUtils]: 310: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,720 INFO L290 TraceCheckUtils]: 311: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,720 INFO L290 TraceCheckUtils]: 312: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,720 INFO L290 TraceCheckUtils]: 313: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,721 INFO L290 TraceCheckUtils]: 314: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,721 INFO L290 TraceCheckUtils]: 315: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,721 INFO L290 TraceCheckUtils]: 316: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,721 INFO L290 TraceCheckUtils]: 317: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,721 INFO L290 TraceCheckUtils]: 318: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,722 INFO L290 TraceCheckUtils]: 319: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,722 INFO L290 TraceCheckUtils]: 320: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,722 INFO L290 TraceCheckUtils]: 321: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,722 INFO L290 TraceCheckUtils]: 322: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,723 INFO L290 TraceCheckUtils]: 323: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,723 INFO L290 TraceCheckUtils]: 324: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,723 INFO L290 TraceCheckUtils]: 325: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,723 INFO L290 TraceCheckUtils]: 326: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,724 INFO L290 TraceCheckUtils]: 327: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,724 INFO L290 TraceCheckUtils]: 328: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,724 INFO L290 TraceCheckUtils]: 329: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,724 INFO L290 TraceCheckUtils]: 330: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,725 INFO L290 TraceCheckUtils]: 331: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,725 INFO L290 TraceCheckUtils]: 332: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,725 INFO L290 TraceCheckUtils]: 333: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,725 INFO L290 TraceCheckUtils]: 334: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,726 INFO L290 TraceCheckUtils]: 335: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,726 INFO L290 TraceCheckUtils]: 336: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,726 INFO L290 TraceCheckUtils]: 337: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,726 INFO L290 TraceCheckUtils]: 338: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 09:01:25,727 INFO L290 TraceCheckUtils]: 339: Hoare triple {59027#(< 19 main_~edgecount~0)} ~i~0 := 0; {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:01:25,727 INFO L290 TraceCheckUtils]: 340: Hoare triple {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:01:25,727 INFO L290 TraceCheckUtils]: 341: Hoare triple {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:01:25,728 INFO L290 TraceCheckUtils]: 342: Hoare triple {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:01:25,728 INFO L290 TraceCheckUtils]: 343: Hoare triple {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:01:25,728 INFO L290 TraceCheckUtils]: 344: Hoare triple {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:01:25,729 INFO L290 TraceCheckUtils]: 345: Hoare triple {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:25,729 INFO L290 TraceCheckUtils]: 346: Hoare triple {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:25,730 INFO L290 TraceCheckUtils]: 347: Hoare triple {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 09:01:25,730 INFO L290 TraceCheckUtils]: 348: Hoare triple {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:25,730 INFO L290 TraceCheckUtils]: 349: Hoare triple {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:25,731 INFO L290 TraceCheckUtils]: 350: Hoare triple {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:01:25,731 INFO L290 TraceCheckUtils]: 351: Hoare triple {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 09:01:25,732 INFO L290 TraceCheckUtils]: 352: Hoare triple {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 09:01:25,732 INFO L290 TraceCheckUtils]: 353: Hoare triple {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 09:01:25,732 INFO L290 TraceCheckUtils]: 354: Hoare triple {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:01:25,733 INFO L290 TraceCheckUtils]: 355: Hoare triple {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:01:25,733 INFO L290 TraceCheckUtils]: 356: Hoare triple {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} is VALID [2022-04-08 09:01:25,733 INFO L290 TraceCheckUtils]: 357: Hoare triple {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59862#(and (< 19 main_~edgecount~0) (<= main_~i~0 6))} is VALID [2022-04-08 09:01:25,734 INFO L290 TraceCheckUtils]: 358: Hoare triple {59862#(and (< 19 main_~edgecount~0) (<= main_~i~0 6))} assume !(~i~0 < ~edgecount~0); {58748#false} is VALID [2022-04-08 09:01:25,734 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-08 09:01:25,734 INFO L290 TraceCheckUtils]: 360: Hoare triple {58748#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58748#false} is VALID [2022-04-08 09:01:25,734 INFO L272 TraceCheckUtils]: 361: Hoare triple {58748#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {58748#false} is VALID [2022-04-08 09:01:25,734 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-08 09:01:25,734 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-08 09:01:25,734 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-08 09:01:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 537 proven. 4829 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-08 09:01:25,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:27,086 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-08 09:01:27,086 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-08 09:01:27,086 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-08 09:01:27,086 INFO L272 TraceCheckUtils]: 361: Hoare triple {58748#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {58748#false} is VALID [2022-04-08 09:01:27,086 INFO L290 TraceCheckUtils]: 360: Hoare triple {58748#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58748#false} is VALID [2022-04-08 09:01:27,086 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-08 09:01:27,086 INFO L290 TraceCheckUtils]: 358: Hoare triple {59902#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {58748#false} is VALID [2022-04-08 09:01:27,087 INFO L290 TraceCheckUtils]: 357: Hoare triple {59906#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59902#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,087 INFO L290 TraceCheckUtils]: 356: Hoare triple {59906#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59906#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,087 INFO L290 TraceCheckUtils]: 355: Hoare triple {59906#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59906#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,088 INFO L290 TraceCheckUtils]: 354: Hoare triple {59916#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59906#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,088 INFO L290 TraceCheckUtils]: 353: Hoare triple {59916#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59916#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,088 INFO L290 TraceCheckUtils]: 352: Hoare triple {59916#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59916#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,088 INFO L290 TraceCheckUtils]: 351: Hoare triple {59926#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59916#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,089 INFO L290 TraceCheckUtils]: 350: Hoare triple {59926#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59926#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,089 INFO L290 TraceCheckUtils]: 349: Hoare triple {59926#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59926#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,089 INFO L290 TraceCheckUtils]: 348: Hoare triple {59936#(< (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59926#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,089 INFO L290 TraceCheckUtils]: 347: Hoare triple {59936#(< (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59936#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,090 INFO L290 TraceCheckUtils]: 346: Hoare triple {59936#(< (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59936#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,090 INFO L290 TraceCheckUtils]: 345: Hoare triple {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59936#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,090 INFO L290 TraceCheckUtils]: 344: Hoare triple {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,091 INFO L290 TraceCheckUtils]: 343: Hoare triple {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,091 INFO L290 TraceCheckUtils]: 342: Hoare triple {59956#(< (+ main_~i~0 6) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,091 INFO L290 TraceCheckUtils]: 341: Hoare triple {59956#(< (+ main_~i~0 6) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59956#(< (+ main_~i~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,092 INFO L290 TraceCheckUtils]: 340: Hoare triple {59956#(< (+ main_~i~0 6) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59956#(< (+ main_~i~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,092 INFO L290 TraceCheckUtils]: 339: Hoare triple {59966#(< 6 main_~edgecount~0)} ~i~0 := 0; {59956#(< (+ main_~i~0 6) main_~edgecount~0)} is VALID [2022-04-08 09:01:27,092 INFO L290 TraceCheckUtils]: 338: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,092 INFO L290 TraceCheckUtils]: 337: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,093 INFO L290 TraceCheckUtils]: 336: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,093 INFO L290 TraceCheckUtils]: 335: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,093 INFO L290 TraceCheckUtils]: 334: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,093 INFO L290 TraceCheckUtils]: 333: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,094 INFO L290 TraceCheckUtils]: 332: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,094 INFO L290 TraceCheckUtils]: 331: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,094 INFO L290 TraceCheckUtils]: 330: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,094 INFO L290 TraceCheckUtils]: 329: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,094 INFO L290 TraceCheckUtils]: 328: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,095 INFO L290 TraceCheckUtils]: 327: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,095 INFO L290 TraceCheckUtils]: 326: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,095 INFO L290 TraceCheckUtils]: 325: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,095 INFO L290 TraceCheckUtils]: 324: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,096 INFO L290 TraceCheckUtils]: 323: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,096 INFO L290 TraceCheckUtils]: 322: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,096 INFO L290 TraceCheckUtils]: 321: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,096 INFO L290 TraceCheckUtils]: 320: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,097 INFO L290 TraceCheckUtils]: 319: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,097 INFO L290 TraceCheckUtils]: 318: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,097 INFO L290 TraceCheckUtils]: 317: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,097 INFO L290 TraceCheckUtils]: 316: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,098 INFO L290 TraceCheckUtils]: 315: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,098 INFO L290 TraceCheckUtils]: 314: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,098 INFO L290 TraceCheckUtils]: 313: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,098 INFO L290 TraceCheckUtils]: 312: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,098 INFO L290 TraceCheckUtils]: 311: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,099 INFO L290 TraceCheckUtils]: 310: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,099 INFO L290 TraceCheckUtils]: 309: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,099 INFO L290 TraceCheckUtils]: 308: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,099 INFO L290 TraceCheckUtils]: 307: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,100 INFO L290 TraceCheckUtils]: 306: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,100 INFO L290 TraceCheckUtils]: 305: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,100 INFO L290 TraceCheckUtils]: 304: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,100 INFO L290 TraceCheckUtils]: 303: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,101 INFO L290 TraceCheckUtils]: 302: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,101 INFO L290 TraceCheckUtils]: 301: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,101 INFO L290 TraceCheckUtils]: 300: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,101 INFO L290 TraceCheckUtils]: 299: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,102 INFO L290 TraceCheckUtils]: 298: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,102 INFO L290 TraceCheckUtils]: 297: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,102 INFO L290 TraceCheckUtils]: 296: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,102 INFO L290 TraceCheckUtils]: 295: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,102 INFO L290 TraceCheckUtils]: 294: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,103 INFO L290 TraceCheckUtils]: 293: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,103 INFO L290 TraceCheckUtils]: 292: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,103 INFO L290 TraceCheckUtils]: 291: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,103 INFO L290 TraceCheckUtils]: 290: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,104 INFO L290 TraceCheckUtils]: 289: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,104 INFO L290 TraceCheckUtils]: 288: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,104 INFO L290 TraceCheckUtils]: 287: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,104 INFO L290 TraceCheckUtils]: 286: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,105 INFO L290 TraceCheckUtils]: 285: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,105 INFO L290 TraceCheckUtils]: 284: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,105 INFO L290 TraceCheckUtils]: 283: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,105 INFO L290 TraceCheckUtils]: 282: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,105 INFO L290 TraceCheckUtils]: 281: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,106 INFO L290 TraceCheckUtils]: 280: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,106 INFO L290 TraceCheckUtils]: 279: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,106 INFO L290 TraceCheckUtils]: 278: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,106 INFO L290 TraceCheckUtils]: 277: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,107 INFO L290 TraceCheckUtils]: 276: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,107 INFO L290 TraceCheckUtils]: 275: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,107 INFO L290 TraceCheckUtils]: 274: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,107 INFO L290 TraceCheckUtils]: 273: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,108 INFO L290 TraceCheckUtils]: 272: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,108 INFO L290 TraceCheckUtils]: 271: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,108 INFO L290 TraceCheckUtils]: 270: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,108 INFO L290 TraceCheckUtils]: 269: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,108 INFO L290 TraceCheckUtils]: 268: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,109 INFO L290 TraceCheckUtils]: 267: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,109 INFO L290 TraceCheckUtils]: 266: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,109 INFO L290 TraceCheckUtils]: 265: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,109 INFO L290 TraceCheckUtils]: 264: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,110 INFO L290 TraceCheckUtils]: 263: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,110 INFO L290 TraceCheckUtils]: 262: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,110 INFO L290 TraceCheckUtils]: 261: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,110 INFO L290 TraceCheckUtils]: 260: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,111 INFO L290 TraceCheckUtils]: 259: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,111 INFO L290 TraceCheckUtils]: 258: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,111 INFO L290 TraceCheckUtils]: 257: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,111 INFO L290 TraceCheckUtils]: 256: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,111 INFO L290 TraceCheckUtils]: 255: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,112 INFO L290 TraceCheckUtils]: 254: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,112 INFO L290 TraceCheckUtils]: 253: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,112 INFO L290 TraceCheckUtils]: 252: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,112 INFO L290 TraceCheckUtils]: 251: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,113 INFO L290 TraceCheckUtils]: 250: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,113 INFO L290 TraceCheckUtils]: 249: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,113 INFO L290 TraceCheckUtils]: 248: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,113 INFO L290 TraceCheckUtils]: 247: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,114 INFO L290 TraceCheckUtils]: 246: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,114 INFO L290 TraceCheckUtils]: 245: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,114 INFO L290 TraceCheckUtils]: 244: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,114 INFO L290 TraceCheckUtils]: 243: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,114 INFO L290 TraceCheckUtils]: 242: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,115 INFO L290 TraceCheckUtils]: 241: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,115 INFO L290 TraceCheckUtils]: 240: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,115 INFO L290 TraceCheckUtils]: 239: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,115 INFO L290 TraceCheckUtils]: 238: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,116 INFO L290 TraceCheckUtils]: 237: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,116 INFO L290 TraceCheckUtils]: 236: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,116 INFO L290 TraceCheckUtils]: 235: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,116 INFO L290 TraceCheckUtils]: 234: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,117 INFO L290 TraceCheckUtils]: 233: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,117 INFO L290 TraceCheckUtils]: 232: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,117 INFO L290 TraceCheckUtils]: 231: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,118 INFO L290 TraceCheckUtils]: 230: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,118 INFO L290 TraceCheckUtils]: 229: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,118 INFO L290 TraceCheckUtils]: 228: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,118 INFO L290 TraceCheckUtils]: 227: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,119 INFO L290 TraceCheckUtils]: 226: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,119 INFO L290 TraceCheckUtils]: 225: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,119 INFO L290 TraceCheckUtils]: 224: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,119 INFO L290 TraceCheckUtils]: 223: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,120 INFO L290 TraceCheckUtils]: 222: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,120 INFO L290 TraceCheckUtils]: 221: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,120 INFO L290 TraceCheckUtils]: 220: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,120 INFO L290 TraceCheckUtils]: 219: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,121 INFO L290 TraceCheckUtils]: 218: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,121 INFO L290 TraceCheckUtils]: 217: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,121 INFO L290 TraceCheckUtils]: 216: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,121 INFO L290 TraceCheckUtils]: 215: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,121 INFO L290 TraceCheckUtils]: 214: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,122 INFO L290 TraceCheckUtils]: 213: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,122 INFO L290 TraceCheckUtils]: 212: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,122 INFO L290 TraceCheckUtils]: 211: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,122 INFO L290 TraceCheckUtils]: 210: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,123 INFO L290 TraceCheckUtils]: 209: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,123 INFO L290 TraceCheckUtils]: 208: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,123 INFO L290 TraceCheckUtils]: 207: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,123 INFO L290 TraceCheckUtils]: 206: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,124 INFO L290 TraceCheckUtils]: 205: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,124 INFO L290 TraceCheckUtils]: 204: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,124 INFO L290 TraceCheckUtils]: 203: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,124 INFO L290 TraceCheckUtils]: 202: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,125 INFO L290 TraceCheckUtils]: 201: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,125 INFO L290 TraceCheckUtils]: 200: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,125 INFO L290 TraceCheckUtils]: 199: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,125 INFO L290 TraceCheckUtils]: 198: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,125 INFO L290 TraceCheckUtils]: 197: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,126 INFO L290 TraceCheckUtils]: 196: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,126 INFO L290 TraceCheckUtils]: 195: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,126 INFO L290 TraceCheckUtils]: 194: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,126 INFO L290 TraceCheckUtils]: 193: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,127 INFO L290 TraceCheckUtils]: 192: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,127 INFO L290 TraceCheckUtils]: 191: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,127 INFO L290 TraceCheckUtils]: 190: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,127 INFO L290 TraceCheckUtils]: 189: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,128 INFO L290 TraceCheckUtils]: 188: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,128 INFO L290 TraceCheckUtils]: 187: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,128 INFO L290 TraceCheckUtils]: 186: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,128 INFO L290 TraceCheckUtils]: 185: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,128 INFO L290 TraceCheckUtils]: 184: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,129 INFO L290 TraceCheckUtils]: 183: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,129 INFO L290 TraceCheckUtils]: 182: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,129 INFO L290 TraceCheckUtils]: 181: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,129 INFO L290 TraceCheckUtils]: 180: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,130 INFO L290 TraceCheckUtils]: 179: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,130 INFO L290 TraceCheckUtils]: 178: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,130 INFO L290 TraceCheckUtils]: 177: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,130 INFO L290 TraceCheckUtils]: 176: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,131 INFO L290 TraceCheckUtils]: 175: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,131 INFO L290 TraceCheckUtils]: 174: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,131 INFO L290 TraceCheckUtils]: 173: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,131 INFO L290 TraceCheckUtils]: 172: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,131 INFO L290 TraceCheckUtils]: 171: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,132 INFO L290 TraceCheckUtils]: 170: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,132 INFO L290 TraceCheckUtils]: 169: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,132 INFO L290 TraceCheckUtils]: 168: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,132 INFO L290 TraceCheckUtils]: 167: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,133 INFO L290 TraceCheckUtils]: 166: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,133 INFO L290 TraceCheckUtils]: 165: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,133 INFO L290 TraceCheckUtils]: 164: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,133 INFO L290 TraceCheckUtils]: 163: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,134 INFO L290 TraceCheckUtils]: 162: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,134 INFO L290 TraceCheckUtils]: 161: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,134 INFO L290 TraceCheckUtils]: 160: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,134 INFO L290 TraceCheckUtils]: 159: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,135 INFO L290 TraceCheckUtils]: 158: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,135 INFO L290 TraceCheckUtils]: 157: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,135 INFO L290 TraceCheckUtils]: 156: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,135 INFO L290 TraceCheckUtils]: 155: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,135 INFO L290 TraceCheckUtils]: 154: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,136 INFO L290 TraceCheckUtils]: 153: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,136 INFO L290 TraceCheckUtils]: 152: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,136 INFO L290 TraceCheckUtils]: 151: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,136 INFO L290 TraceCheckUtils]: 150: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,137 INFO L290 TraceCheckUtils]: 149: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,137 INFO L290 TraceCheckUtils]: 148: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,137 INFO L290 TraceCheckUtils]: 147: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,137 INFO L290 TraceCheckUtils]: 146: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,138 INFO L290 TraceCheckUtils]: 145: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,138 INFO L290 TraceCheckUtils]: 144: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,138 INFO L290 TraceCheckUtils]: 143: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,138 INFO L290 TraceCheckUtils]: 142: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,139 INFO L290 TraceCheckUtils]: 141: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,139 INFO L290 TraceCheckUtils]: 140: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,139 INFO L290 TraceCheckUtils]: 139: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,139 INFO L290 TraceCheckUtils]: 138: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,140 INFO L290 TraceCheckUtils]: 137: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,140 INFO L290 TraceCheckUtils]: 136: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,140 INFO L290 TraceCheckUtils]: 135: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,140 INFO L290 TraceCheckUtils]: 134: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,141 INFO L290 TraceCheckUtils]: 133: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,141 INFO L290 TraceCheckUtils]: 132: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,141 INFO L290 TraceCheckUtils]: 131: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,141 INFO L290 TraceCheckUtils]: 130: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,141 INFO L290 TraceCheckUtils]: 129: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,142 INFO L290 TraceCheckUtils]: 128: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,142 INFO L290 TraceCheckUtils]: 127: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,142 INFO L290 TraceCheckUtils]: 126: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,142 INFO L290 TraceCheckUtils]: 125: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,143 INFO L290 TraceCheckUtils]: 124: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,143 INFO L290 TraceCheckUtils]: 123: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,143 INFO L290 TraceCheckUtils]: 122: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,144 INFO L290 TraceCheckUtils]: 121: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,144 INFO L290 TraceCheckUtils]: 120: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,144 INFO L290 TraceCheckUtils]: 119: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,144 INFO L290 TraceCheckUtils]: 118: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,145 INFO L290 TraceCheckUtils]: 117: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,145 INFO L290 TraceCheckUtils]: 116: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,145 INFO L290 TraceCheckUtils]: 115: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,145 INFO L290 TraceCheckUtils]: 114: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,146 INFO L290 TraceCheckUtils]: 113: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,146 INFO L290 TraceCheckUtils]: 112: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,146 INFO L290 TraceCheckUtils]: 111: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,146 INFO L290 TraceCheckUtils]: 110: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,147 INFO L290 TraceCheckUtils]: 109: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,147 INFO L290 TraceCheckUtils]: 108: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,147 INFO L290 TraceCheckUtils]: 107: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,147 INFO L290 TraceCheckUtils]: 106: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,147 INFO L290 TraceCheckUtils]: 105: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,148 INFO L290 TraceCheckUtils]: 104: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,148 INFO L290 TraceCheckUtils]: 103: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,148 INFO L290 TraceCheckUtils]: 102: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,148 INFO L290 TraceCheckUtils]: 101: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,149 INFO L290 TraceCheckUtils]: 100: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,149 INFO L290 TraceCheckUtils]: 99: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,149 INFO L290 TraceCheckUtils]: 98: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,149 INFO L290 TraceCheckUtils]: 97: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,150 INFO L290 TraceCheckUtils]: 96: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,150 INFO L290 TraceCheckUtils]: 95: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,150 INFO L290 TraceCheckUtils]: 94: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,150 INFO L290 TraceCheckUtils]: 93: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,151 INFO L290 TraceCheckUtils]: 92: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,151 INFO L290 TraceCheckUtils]: 91: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,151 INFO L290 TraceCheckUtils]: 90: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,151 INFO L290 TraceCheckUtils]: 89: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,152 INFO L290 TraceCheckUtils]: 88: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,152 INFO L290 TraceCheckUtils]: 87: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,152 INFO L290 TraceCheckUtils]: 86: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,152 INFO L290 TraceCheckUtils]: 85: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,152 INFO L290 TraceCheckUtils]: 84: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,153 INFO L290 TraceCheckUtils]: 83: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,153 INFO L290 TraceCheckUtils]: 82: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {58893#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 09:01:27,154 INFO L290 TraceCheckUtils]: 80: Hoare triple {58883#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58893#(<= 6 main_~j~0)} is VALID [2022-04-08 09:01:27,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {58883#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 09:01:27,154 INFO L290 TraceCheckUtils]: 78: Hoare triple {58883#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 09:01:27,155 INFO L290 TraceCheckUtils]: 77: Hoare triple {58873#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 09:01:27,155 INFO L290 TraceCheckUtils]: 76: Hoare triple {58873#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 09:01:27,155 INFO L290 TraceCheckUtils]: 75: Hoare triple {58873#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 09:01:27,156 INFO L290 TraceCheckUtils]: 74: Hoare triple {58863#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 09:01:27,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {58863#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 09:01:27,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {58863#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 09:01:27,156 INFO L290 TraceCheckUtils]: 71: Hoare triple {58853#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 09:01:27,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {58853#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 09:01:27,157 INFO L290 TraceCheckUtils]: 69: Hoare triple {58853#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 09:01:27,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {58843#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 09:01:27,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {58843#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 09:01:27,158 INFO L290 TraceCheckUtils]: 66: Hoare triple {58843#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 09:01:27,158 INFO L290 TraceCheckUtils]: 65: Hoare triple {58833#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 09:01:27,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {58833#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 09:01:27,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {58833#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 09:01:27,159 INFO L290 TraceCheckUtils]: 62: Hoare triple {60798#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 09:01:27,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {60798#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60798#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:01:27,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {60798#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60798#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:01:27,160 INFO L290 TraceCheckUtils]: 59: Hoare triple {60808#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60798#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 09:01:27,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {60808#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60808#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:01:27,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {60808#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60808#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:01:27,161 INFO L290 TraceCheckUtils]: 56: Hoare triple {60818#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60808#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 09:01:27,161 INFO L290 TraceCheckUtils]: 55: Hoare triple {60818#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60818#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:01:27,161 INFO L290 TraceCheckUtils]: 54: Hoare triple {60818#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60818#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:01:27,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {60828#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60818#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 09:01:27,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {60828#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60828#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:01:27,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {60828#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60828#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:01:27,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {60838#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60828#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 09:01:27,163 INFO L290 TraceCheckUtils]: 49: Hoare triple {60838#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60838#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:01:27,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {60838#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60838#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:01:27,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {60848#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60838#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 09:01:27,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {60848#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60848#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:01:27,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {60848#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60848#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:01:27,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {60858#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60848#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 09:01:27,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {60858#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60858#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:01:27,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {60858#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60858#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:01:27,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {60868#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60858#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 09:01:27,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {60868#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60868#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:01:27,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {60868#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60868#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:01:27,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {60878#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60868#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 09:01:27,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {60878#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60878#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:01:27,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {60878#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60878#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:01:27,167 INFO L290 TraceCheckUtils]: 35: Hoare triple {60888#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60878#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 09:01:27,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {60888#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60888#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:01:27,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {60888#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60888#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:01:27,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {60898#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60888#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 09:01:27,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {60898#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60898#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:01:27,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {60898#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60898#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:01:27,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {60908#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60898#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 09:01:27,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {60908#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60908#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:01:27,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {60908#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60908#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:01:27,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {60918#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60908#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 09:01:27,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {60918#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60918#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:01:27,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {60918#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60918#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {60918#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {58747#true} ~i~0 := 0; {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {58747#true} assume !(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 09:01:27,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 09:01:27,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:27,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 09:01:27,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {58747#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 09:01:27,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 09:01:27,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {58747#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {58747#true} is VALID [2022-04-08 09:01:27,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-08 09:01:27,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-08 09:01:27,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-08 09:01:27,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {58747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-08 09:01:27,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58747#true} is VALID [2022-04-08 09:01:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 537 proven. 4829 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-08 09:01:27,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36058475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:27,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:27,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 30, 30] total 60 [2022-04-08 09:01:27,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:27,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [502051711] [2022-04-08 09:01:27,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [502051711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:27,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:27,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:01:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952706105] [2022-04-08 09:01:27,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:27,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 365 [2022-04-08 09:01:27,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:27,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:27,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:27,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:01:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:01:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=2668, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 09:01:27,206 INFO L87 Difference]: Start difference. First operand 370 states and 479 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:30,575 INFO L93 Difference]: Finished difference Result 614 states and 798 transitions. [2022-04-08 09:01:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:01:30,576 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 365 [2022-04-08 09:01:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2022-04-08 09:01:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2022-04-08 09:01:30,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 182 transitions. [2022-04-08 09:01:30,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:30,726 INFO L225 Difference]: With dead ends: 614 [2022-04-08 09:01:30,726 INFO L226 Difference]: Without dead ends: 603 [2022-04-08 09:01:30,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2027 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1053, Invalid=3503, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 09:01:30,727 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 259 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:30,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 42 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:01:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-08 09:01:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 373. [2022-04-08 09:01:32,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:32,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:32,305 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:32,306 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:32,318 INFO L93 Difference]: Finished difference Result 603 states and 786 transitions. [2022-04-08 09:01:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 786 transitions. [2022-04-08 09:01:32,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:32,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:32,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 603 states. [2022-04-08 09:01:32,318 INFO L87 Difference]: Start difference. First operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 603 states. [2022-04-08 09:01:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:32,336 INFO L93 Difference]: Finished difference Result 603 states and 786 transitions. [2022-04-08 09:01:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 786 transitions. [2022-04-08 09:01:32,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:32,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:32,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:32,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 482 transitions. [2022-04-08 09:01:32,352 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 482 transitions. Word has length 365 [2022-04-08 09:01:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:32,352 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 482 transitions. [2022-04-08 09:01:32,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:32,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 373 states and 482 transitions. [2022-04-08 09:01:33,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 482 transitions. [2022-04-08 09:01:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2022-04-08 09:01:33,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:33,163 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:33,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-08 09:01:33,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 09:01:33,363 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash -382120294, now seen corresponding path program 65 times [2022-04-08 09:01:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:33,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1490793954] [2022-04-08 09:01:33,367 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:01:33,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:33,367 INFO L85 PathProgramCache]: Analyzing trace with hash -382120294, now seen corresponding path program 66 times [2022-04-08 09:01:33,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:33,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728642546] [2022-04-08 09:01:33,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:33,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {64209#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {64195#true} is VALID [2022-04-08 09:01:33,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-08 09:01:33,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-08 09:01:33,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {64195#true} call ULTIMATE.init(); {64209#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:33,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {64209#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {64195#true} is VALID [2022-04-08 09:01:33,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-08 09:01:33,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-08 09:01:33,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {64195#true} call #t~ret22 := main(); {64195#true} is VALID [2022-04-08 09:01:33,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {64195#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {64200#(<= 20 main_~edgecount~0)} ~i~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,731 INFO L290 TraceCheckUtils]: 55: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,732 INFO L290 TraceCheckUtils]: 59: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,732 INFO L290 TraceCheckUtils]: 60: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,732 INFO L290 TraceCheckUtils]: 62: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,735 INFO L290 TraceCheckUtils]: 72: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,735 INFO L290 TraceCheckUtils]: 74: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,735 INFO L290 TraceCheckUtils]: 75: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,735 INFO L290 TraceCheckUtils]: 76: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,736 INFO L290 TraceCheckUtils]: 77: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,736 INFO L290 TraceCheckUtils]: 78: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,736 INFO L290 TraceCheckUtils]: 79: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,736 INFO L290 TraceCheckUtils]: 80: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,737 INFO L290 TraceCheckUtils]: 81: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,737 INFO L290 TraceCheckUtils]: 82: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,737 INFO L290 TraceCheckUtils]: 83: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,737 INFO L290 TraceCheckUtils]: 84: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,738 INFO L290 TraceCheckUtils]: 85: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,738 INFO L290 TraceCheckUtils]: 86: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,738 INFO L290 TraceCheckUtils]: 87: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,738 INFO L290 TraceCheckUtils]: 88: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,739 INFO L290 TraceCheckUtils]: 89: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,739 INFO L290 TraceCheckUtils]: 90: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,739 INFO L290 TraceCheckUtils]: 91: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,739 INFO L290 TraceCheckUtils]: 92: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,740 INFO L290 TraceCheckUtils]: 93: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,740 INFO L290 TraceCheckUtils]: 94: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,740 INFO L290 TraceCheckUtils]: 95: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,740 INFO L290 TraceCheckUtils]: 96: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,740 INFO L290 TraceCheckUtils]: 97: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,741 INFO L290 TraceCheckUtils]: 98: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,741 INFO L290 TraceCheckUtils]: 99: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,741 INFO L290 TraceCheckUtils]: 100: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,741 INFO L290 TraceCheckUtils]: 101: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,742 INFO L290 TraceCheckUtils]: 102: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,742 INFO L290 TraceCheckUtils]: 103: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,742 INFO L290 TraceCheckUtils]: 104: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,742 INFO L290 TraceCheckUtils]: 105: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,742 INFO L290 TraceCheckUtils]: 106: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,743 INFO L290 TraceCheckUtils]: 107: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,743 INFO L290 TraceCheckUtils]: 108: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,743 INFO L290 TraceCheckUtils]: 109: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,743 INFO L290 TraceCheckUtils]: 110: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,744 INFO L290 TraceCheckUtils]: 111: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,744 INFO L290 TraceCheckUtils]: 112: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,744 INFO L290 TraceCheckUtils]: 113: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,744 INFO L290 TraceCheckUtils]: 114: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,745 INFO L290 TraceCheckUtils]: 115: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,745 INFO L290 TraceCheckUtils]: 116: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,745 INFO L290 TraceCheckUtils]: 117: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,745 INFO L290 TraceCheckUtils]: 118: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,745 INFO L290 TraceCheckUtils]: 119: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,746 INFO L290 TraceCheckUtils]: 120: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,746 INFO L290 TraceCheckUtils]: 121: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,746 INFO L290 TraceCheckUtils]: 122: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,746 INFO L290 TraceCheckUtils]: 123: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,747 INFO L290 TraceCheckUtils]: 124: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,747 INFO L290 TraceCheckUtils]: 125: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,747 INFO L290 TraceCheckUtils]: 126: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,747 INFO L290 TraceCheckUtils]: 127: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,748 INFO L290 TraceCheckUtils]: 128: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,748 INFO L290 TraceCheckUtils]: 129: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,748 INFO L290 TraceCheckUtils]: 130: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,748 INFO L290 TraceCheckUtils]: 131: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,748 INFO L290 TraceCheckUtils]: 132: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,749 INFO L290 TraceCheckUtils]: 133: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,749 INFO L290 TraceCheckUtils]: 134: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,749 INFO L290 TraceCheckUtils]: 135: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,749 INFO L290 TraceCheckUtils]: 136: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,750 INFO L290 TraceCheckUtils]: 137: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,750 INFO L290 TraceCheckUtils]: 138: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,750 INFO L290 TraceCheckUtils]: 139: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,750 INFO L290 TraceCheckUtils]: 140: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,751 INFO L290 TraceCheckUtils]: 141: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,751 INFO L290 TraceCheckUtils]: 142: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,751 INFO L290 TraceCheckUtils]: 143: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,751 INFO L290 TraceCheckUtils]: 144: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,752 INFO L290 TraceCheckUtils]: 145: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,752 INFO L290 TraceCheckUtils]: 146: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,752 INFO L290 TraceCheckUtils]: 147: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,752 INFO L290 TraceCheckUtils]: 148: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,752 INFO L290 TraceCheckUtils]: 149: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,753 INFO L290 TraceCheckUtils]: 150: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,753 INFO L290 TraceCheckUtils]: 151: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,753 INFO L290 TraceCheckUtils]: 152: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,753 INFO L290 TraceCheckUtils]: 153: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,754 INFO L290 TraceCheckUtils]: 154: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,754 INFO L290 TraceCheckUtils]: 155: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,754 INFO L290 TraceCheckUtils]: 156: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,754 INFO L290 TraceCheckUtils]: 157: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,754 INFO L290 TraceCheckUtils]: 158: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,755 INFO L290 TraceCheckUtils]: 159: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,755 INFO L290 TraceCheckUtils]: 160: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,755 INFO L290 TraceCheckUtils]: 161: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,755 INFO L290 TraceCheckUtils]: 162: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,756 INFO L290 TraceCheckUtils]: 163: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,756 INFO L290 TraceCheckUtils]: 164: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,756 INFO L290 TraceCheckUtils]: 165: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,756 INFO L290 TraceCheckUtils]: 166: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,757 INFO L290 TraceCheckUtils]: 167: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,757 INFO L290 TraceCheckUtils]: 168: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,757 INFO L290 TraceCheckUtils]: 169: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,757 INFO L290 TraceCheckUtils]: 170: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,757 INFO L290 TraceCheckUtils]: 171: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,758 INFO L290 TraceCheckUtils]: 172: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,758 INFO L290 TraceCheckUtils]: 173: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,758 INFO L290 TraceCheckUtils]: 174: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,758 INFO L290 TraceCheckUtils]: 175: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,759 INFO L290 TraceCheckUtils]: 176: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,759 INFO L290 TraceCheckUtils]: 177: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,759 INFO L290 TraceCheckUtils]: 178: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,759 INFO L290 TraceCheckUtils]: 179: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,760 INFO L290 TraceCheckUtils]: 180: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,760 INFO L290 TraceCheckUtils]: 181: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,760 INFO L290 TraceCheckUtils]: 182: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,760 INFO L290 TraceCheckUtils]: 183: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,761 INFO L290 TraceCheckUtils]: 184: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,761 INFO L290 TraceCheckUtils]: 185: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,761 INFO L290 TraceCheckUtils]: 186: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,761 INFO L290 TraceCheckUtils]: 187: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,761 INFO L290 TraceCheckUtils]: 188: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,762 INFO L290 TraceCheckUtils]: 189: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,762 INFO L290 TraceCheckUtils]: 190: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,762 INFO L290 TraceCheckUtils]: 191: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,762 INFO L290 TraceCheckUtils]: 192: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,763 INFO L290 TraceCheckUtils]: 193: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,763 INFO L290 TraceCheckUtils]: 194: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,763 INFO L290 TraceCheckUtils]: 195: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,763 INFO L290 TraceCheckUtils]: 196: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,763 INFO L290 TraceCheckUtils]: 197: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,764 INFO L290 TraceCheckUtils]: 198: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,764 INFO L290 TraceCheckUtils]: 199: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,764 INFO L290 TraceCheckUtils]: 200: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,764 INFO L290 TraceCheckUtils]: 201: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,765 INFO L290 TraceCheckUtils]: 202: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,765 INFO L290 TraceCheckUtils]: 203: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,765 INFO L290 TraceCheckUtils]: 204: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,765 INFO L290 TraceCheckUtils]: 205: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,766 INFO L290 TraceCheckUtils]: 206: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,766 INFO L290 TraceCheckUtils]: 207: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,766 INFO L290 TraceCheckUtils]: 208: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,766 INFO L290 TraceCheckUtils]: 209: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,766 INFO L290 TraceCheckUtils]: 210: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,767 INFO L290 TraceCheckUtils]: 211: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,767 INFO L290 TraceCheckUtils]: 212: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,767 INFO L290 TraceCheckUtils]: 213: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,767 INFO L290 TraceCheckUtils]: 214: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,768 INFO L290 TraceCheckUtils]: 215: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,768 INFO L290 TraceCheckUtils]: 216: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,768 INFO L290 TraceCheckUtils]: 217: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,768 INFO L290 TraceCheckUtils]: 218: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,768 INFO L290 TraceCheckUtils]: 219: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,769 INFO L290 TraceCheckUtils]: 220: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,769 INFO L290 TraceCheckUtils]: 221: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,769 INFO L290 TraceCheckUtils]: 222: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,769 INFO L290 TraceCheckUtils]: 223: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,770 INFO L290 TraceCheckUtils]: 224: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,770 INFO L290 TraceCheckUtils]: 225: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,770 INFO L290 TraceCheckUtils]: 226: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,770 INFO L290 TraceCheckUtils]: 227: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,771 INFO L290 TraceCheckUtils]: 228: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,771 INFO L290 TraceCheckUtils]: 229: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,771 INFO L290 TraceCheckUtils]: 230: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,771 INFO L290 TraceCheckUtils]: 231: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,771 INFO L290 TraceCheckUtils]: 232: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,772 INFO L290 TraceCheckUtils]: 233: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,772 INFO L290 TraceCheckUtils]: 234: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,772 INFO L290 TraceCheckUtils]: 235: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,772 INFO L290 TraceCheckUtils]: 236: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,773 INFO L290 TraceCheckUtils]: 237: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,773 INFO L290 TraceCheckUtils]: 238: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,773 INFO L290 TraceCheckUtils]: 239: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,773 INFO L290 TraceCheckUtils]: 240: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,774 INFO L290 TraceCheckUtils]: 241: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,774 INFO L290 TraceCheckUtils]: 242: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,774 INFO L290 TraceCheckUtils]: 243: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,774 INFO L290 TraceCheckUtils]: 244: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,775 INFO L290 TraceCheckUtils]: 245: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,775 INFO L290 TraceCheckUtils]: 246: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,775 INFO L290 TraceCheckUtils]: 247: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,775 INFO L290 TraceCheckUtils]: 248: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,776 INFO L290 TraceCheckUtils]: 249: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,776 INFO L290 TraceCheckUtils]: 250: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,776 INFO L290 TraceCheckUtils]: 251: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,776 INFO L290 TraceCheckUtils]: 252: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,777 INFO L290 TraceCheckUtils]: 253: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,777 INFO L290 TraceCheckUtils]: 254: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,777 INFO L290 TraceCheckUtils]: 255: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,777 INFO L290 TraceCheckUtils]: 256: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,778 INFO L290 TraceCheckUtils]: 257: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,778 INFO L290 TraceCheckUtils]: 258: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,778 INFO L290 TraceCheckUtils]: 259: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,778 INFO L290 TraceCheckUtils]: 260: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,779 INFO L290 TraceCheckUtils]: 261: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,779 INFO L290 TraceCheckUtils]: 262: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,779 INFO L290 TraceCheckUtils]: 263: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,779 INFO L290 TraceCheckUtils]: 264: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,780 INFO L290 TraceCheckUtils]: 265: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,780 INFO L290 TraceCheckUtils]: 266: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,780 INFO L290 TraceCheckUtils]: 267: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,780 INFO L290 TraceCheckUtils]: 268: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,780 INFO L290 TraceCheckUtils]: 269: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,781 INFO L290 TraceCheckUtils]: 270: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,781 INFO L290 TraceCheckUtils]: 271: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,781 INFO L290 TraceCheckUtils]: 272: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,781 INFO L290 TraceCheckUtils]: 273: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,782 INFO L290 TraceCheckUtils]: 274: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,782 INFO L290 TraceCheckUtils]: 275: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,782 INFO L290 TraceCheckUtils]: 276: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,782 INFO L290 TraceCheckUtils]: 277: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,783 INFO L290 TraceCheckUtils]: 278: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,783 INFO L290 TraceCheckUtils]: 279: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,783 INFO L290 TraceCheckUtils]: 280: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,783 INFO L290 TraceCheckUtils]: 281: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,784 INFO L290 TraceCheckUtils]: 282: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,784 INFO L290 TraceCheckUtils]: 283: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,784 INFO L290 TraceCheckUtils]: 284: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,784 INFO L290 TraceCheckUtils]: 285: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,785 INFO L290 TraceCheckUtils]: 286: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,785 INFO L290 TraceCheckUtils]: 287: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,785 INFO L290 TraceCheckUtils]: 288: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,785 INFO L290 TraceCheckUtils]: 289: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,785 INFO L290 TraceCheckUtils]: 290: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,786 INFO L290 TraceCheckUtils]: 291: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,786 INFO L290 TraceCheckUtils]: 292: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,786 INFO L290 TraceCheckUtils]: 293: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,786 INFO L290 TraceCheckUtils]: 294: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,787 INFO L290 TraceCheckUtils]: 295: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,787 INFO L290 TraceCheckUtils]: 296: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,787 INFO L290 TraceCheckUtils]: 297: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,787 INFO L290 TraceCheckUtils]: 298: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,788 INFO L290 TraceCheckUtils]: 299: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,788 INFO L290 TraceCheckUtils]: 300: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,788 INFO L290 TraceCheckUtils]: 301: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,788 INFO L290 TraceCheckUtils]: 302: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,788 INFO L290 TraceCheckUtils]: 303: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,789 INFO L290 TraceCheckUtils]: 304: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,789 INFO L290 TraceCheckUtils]: 305: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,789 INFO L290 TraceCheckUtils]: 306: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,789 INFO L290 TraceCheckUtils]: 307: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,790 INFO L290 TraceCheckUtils]: 308: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,790 INFO L290 TraceCheckUtils]: 309: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,790 INFO L290 TraceCheckUtils]: 310: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,790 INFO L290 TraceCheckUtils]: 311: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,791 INFO L290 TraceCheckUtils]: 312: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,791 INFO L290 TraceCheckUtils]: 313: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,791 INFO L290 TraceCheckUtils]: 314: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,791 INFO L290 TraceCheckUtils]: 315: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,792 INFO L290 TraceCheckUtils]: 316: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,792 INFO L290 TraceCheckUtils]: 317: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,792 INFO L290 TraceCheckUtils]: 318: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,792 INFO L290 TraceCheckUtils]: 319: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,792 INFO L290 TraceCheckUtils]: 320: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,793 INFO L290 TraceCheckUtils]: 321: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,793 INFO L290 TraceCheckUtils]: 322: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,793 INFO L290 TraceCheckUtils]: 323: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,793 INFO L290 TraceCheckUtils]: 324: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,794 INFO L290 TraceCheckUtils]: 325: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,794 INFO L290 TraceCheckUtils]: 326: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,794 INFO L290 TraceCheckUtils]: 327: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,794 INFO L290 TraceCheckUtils]: 328: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,795 INFO L290 TraceCheckUtils]: 329: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,795 INFO L290 TraceCheckUtils]: 330: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,795 INFO L290 TraceCheckUtils]: 331: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,795 INFO L290 TraceCheckUtils]: 332: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,796 INFO L290 TraceCheckUtils]: 333: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,796 INFO L290 TraceCheckUtils]: 334: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,796 INFO L290 TraceCheckUtils]: 335: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,796 INFO L290 TraceCheckUtils]: 336: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,796 INFO L290 TraceCheckUtils]: 337: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,797 INFO L290 TraceCheckUtils]: 338: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 09:01:33,797 INFO L290 TraceCheckUtils]: 339: Hoare triple {64200#(<= 20 main_~edgecount~0)} ~i~0 := 0; {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:33,798 INFO L290 TraceCheckUtils]: 340: Hoare triple {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:33,798 INFO L290 TraceCheckUtils]: 341: Hoare triple {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 09:01:33,798 INFO L290 TraceCheckUtils]: 342: Hoare triple {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,799 INFO L290 TraceCheckUtils]: 343: Hoare triple {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,799 INFO L290 TraceCheckUtils]: 344: Hoare triple {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,799 INFO L290 TraceCheckUtils]: 345: Hoare triple {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,800 INFO L290 TraceCheckUtils]: 346: Hoare triple {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,800 INFO L290 TraceCheckUtils]: 347: Hoare triple {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,800 INFO L290 TraceCheckUtils]: 348: Hoare triple {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,800 INFO L290 TraceCheckUtils]: 349: Hoare triple {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,801 INFO L290 TraceCheckUtils]: 350: Hoare triple {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,801 INFO L290 TraceCheckUtils]: 351: Hoare triple {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,801 INFO L290 TraceCheckUtils]: 352: Hoare triple {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,801 INFO L290 TraceCheckUtils]: 353: Hoare triple {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,802 INFO L290 TraceCheckUtils]: 354: Hoare triple {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,802 INFO L290 TraceCheckUtils]: 355: Hoare triple {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,802 INFO L290 TraceCheckUtils]: 356: Hoare triple {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,803 INFO L290 TraceCheckUtils]: 357: Hoare triple {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,803 INFO L290 TraceCheckUtils]: 358: Hoare triple {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,803 INFO L290 TraceCheckUtils]: 359: Hoare triple {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 360: Hoare triple {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64208#(<= (+ main_~i~0 13) main_~edgecount~0)} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 361: Hoare triple {64208#(<= (+ main_~i~0 13) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 362: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 363: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 09:01:33,804 INFO L272 TraceCheckUtils]: 364: Hoare triple {64196#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {64196#false} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 365: Hoare triple {64196#false} ~cond := #in~cond; {64196#false} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 366: Hoare triple {64196#false} assume 0 == ~cond; {64196#false} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 367: Hoare triple {64196#false} assume !false; {64196#false} is VALID [2022-04-08 09:01:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15490 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 09:01:33,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:33,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728642546] [2022-04-08 09:01:33,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728642546] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:33,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362429799] [2022-04-08 09:01:33,805 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:01:33,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:33,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:33,806 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:01:33,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-08 09:01:44,675 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 09:01:44,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:44,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 09:01:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:44,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:44,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-04-08 09:01:45,004 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-08 09:01:45,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2022-04-08 09:01:45,161 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-08 09:01:45,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2022-04-08 09:01:45,302 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-08 09:01:45,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2022-04-08 09:01:45,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 09:01:45,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 09:01:45,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 09:01:45,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 09:01:45,463 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-08 09:01:45,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 58 [2022-04-08 09:01:45,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 09:01:45,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 09:01:45,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 09:01:45,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 09:01:45,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 09:01:45,802 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-08 09:01:45,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 73 [2022-04-08 09:01:48,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 09:01:48,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 09:01:48,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 09:01:48,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 09:01:48,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 09:01:48,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 09:01:48,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 09:01:48,062 INFO L356 Elim1Store]: treesize reduction 99, result has 19.5 percent of original size [2022-04-08 09:01:48,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 91 [2022-04-08 09:01:48,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 09:01:48,737 INFO L356 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2022-04-08 09:01:48,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 61 [2022-04-08 09:01:49,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {64195#true} call ULTIMATE.init(); {64195#true} is VALID [2022-04-08 09:01:49,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {64195#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {64195#true} is VALID [2022-04-08 09:01:49,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-08 09:01:49,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-08 09:01:49,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {64195#true} call #t~ret22 := main(); {64195#true} is VALID [2022-04-08 09:01:49,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {64195#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64263#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {64263#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64267#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {64267#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64271#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {64271#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64275#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {64275#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64279#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (<= main_~i~0 (+ v_main_~i~0_542 1)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (< v_main_~i~0_542 main_~nodecount~0))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {64279#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (<= main_~i~0 (+ v_main_~i~0_542 1)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (< v_main_~i~0_542 main_~nodecount~0))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} ~i~0 := 0; {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64294#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0) (<= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))))} is VALID [2022-04-08 09:01:49,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {64294#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0) (<= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64301#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= main_~j~0 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 09:01:49,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {64301#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= main_~j~0 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64305#(and (<= |main_#t~mem11| |main_#t~mem9|) (<= 1 |main_#t~mem10|))} is VALID [2022-04-08 09:01:49,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {64305#(and (<= |main_#t~mem11| |main_#t~mem9|) (<= 1 |main_#t~mem10|))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 48: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 50: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 51: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 52: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 58: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 59: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 64: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 65: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 66: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 67: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 68: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 70: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 71: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 72: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 73: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 74: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 75: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 76: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 77: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,650 INFO L290 TraceCheckUtils]: 78: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 81: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 82: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 83: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 84: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 87: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 88: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 89: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 90: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 91: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 92: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 93: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 94: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 95: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 96: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 97: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 98: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,651 INFO L290 TraceCheckUtils]: 99: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 100: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 101: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 102: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 103: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 104: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 105: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 106: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 107: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 108: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 109: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 110: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 111: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 112: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 113: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 114: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 115: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 116: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 117: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 118: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 119: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,652 INFO L290 TraceCheckUtils]: 120: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 121: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 122: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 123: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 124: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 125: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 126: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 127: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 128: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 129: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 130: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 131: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 132: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 133: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 134: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 135: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 136: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 137: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 138: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 139: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 140: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,653 INFO L290 TraceCheckUtils]: 141: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 142: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 143: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 144: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 145: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 146: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 147: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 148: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 149: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 150: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 151: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 152: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 153: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 154: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 155: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 156: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 157: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 158: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 159: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 160: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 161: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,654 INFO L290 TraceCheckUtils]: 162: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 163: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 164: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 165: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 166: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 167: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 168: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 169: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 170: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 171: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 172: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 173: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 174: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 175: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 176: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 177: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 178: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 179: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 180: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 181: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 182: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,655 INFO L290 TraceCheckUtils]: 183: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 184: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 185: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 186: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 187: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 188: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 189: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 190: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 191: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 192: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 193: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 194: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 195: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 196: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 197: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 198: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 199: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 200: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 201: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 202: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 203: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,656 INFO L290 TraceCheckUtils]: 204: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 205: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 206: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 207: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 208: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 209: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 210: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 211: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 212: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 213: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 214: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 215: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 216: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 217: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 218: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 219: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 220: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 221: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 222: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 223: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 224: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 225: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,657 INFO L290 TraceCheckUtils]: 226: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 227: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 228: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 229: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 230: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 231: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 232: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 233: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 234: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 235: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 236: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 237: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 238: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 239: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 240: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 241: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 242: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 243: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 244: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 245: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 246: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,658 INFO L290 TraceCheckUtils]: 247: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 248: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 249: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 250: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 251: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 252: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 253: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 254: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 255: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 256: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 257: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 258: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 259: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 260: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 261: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 262: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 263: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 264: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 265: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 266: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 267: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,659 INFO L290 TraceCheckUtils]: 268: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 269: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 270: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 271: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 272: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 273: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 274: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 275: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 276: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 277: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 278: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 279: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 280: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 281: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 282: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 283: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 284: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 285: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 286: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 287: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,660 INFO L290 TraceCheckUtils]: 288: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 289: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 290: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 291: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 292: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 293: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 294: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 295: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 296: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 297: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 298: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 299: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 300: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 301: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 302: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 303: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 304: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 305: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 306: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 307: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 308: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,661 INFO L290 TraceCheckUtils]: 309: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 310: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 311: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 312: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 313: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 314: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 315: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 316: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 317: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 318: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 319: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 320: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 321: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 322: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 323: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 324: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 325: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 326: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 327: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 328: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 329: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 330: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,662 INFO L290 TraceCheckUtils]: 331: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 332: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 333: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 334: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 335: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 336: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 337: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 338: Hoare triple {64196#false} assume !(~i~0 < ~nodecount~0); {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 339: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 340: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 341: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 342: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 343: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 344: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 345: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 346: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 347: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 348: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 349: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 350: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 09:01:49,663 INFO L290 TraceCheckUtils]: 351: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 352: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 353: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 354: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 355: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 356: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 357: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 358: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 359: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 360: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 361: Hoare triple {64196#false} assume !(~i~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 362: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 363: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L272 TraceCheckUtils]: 364: Hoare triple {64196#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 365: Hoare triple {64196#false} ~cond := #in~cond; {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 366: Hoare triple {64196#false} assume 0 == ~cond; {64196#false} is VALID [2022-04-08 09:01:49,664 INFO L290 TraceCheckUtils]: 367: Hoare triple {64196#false} assume !false; {64196#false} is VALID [2022-04-08 09:01:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15490 backedges. 519 proven. 17 refuted. 0 times theorem prover too weak. 14954 trivial. 0 not checked. [2022-04-08 09:01:49,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:55,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_1176 Int)) (or (not (<= v_main_~x~0_1176 (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)))) (forall ((v_ArrVal_6099 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_1176 4) |c_main_~#distance~0.offset|) v_ArrVal_6099))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse2 (* c_main_~j~0 4))) (<= (select .cse0 (+ (* 4 (select (select .cse1 |c_main_~#Dest~0.base|) (+ .cse2 4 |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|)) (+ (select .cse0 (+ (* (select (select .cse1 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse2 4)) 4) |c_main_~#distance~0.offset|)) (select (select .cse1 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse2 4))))))))) is different from false [2022-04-08 09:01:57,671 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_1176 Int) (v_ArrVal_6099 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_1176 4) |c_main_~#distance~0.offset|) v_ArrVal_6099))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0))) (<= (select .cse0 (+ (* (select (select .cse1 |c_main_~#Dest~0.base|) (+ 4 |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|)) (+ (select (select .cse1 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 4)) (select .cse0 (+ (* (select (select .cse1 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 4)) 4) |c_main_~#distance~0.offset|)))))) (not (<= v_main_~x~0_1176 (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|))))) is different from false [2022-04-08 09:02:18,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (not (< (+ main_~i~0 1) c_main_~nodecount~0)) (< (+ main_~i~0 2) c_main_~nodecount~0) (forall ((v_ArrVal_6098 Int) (v_ArrVal_6096 Int) (v_main_~x~0_1176 Int) (v_ArrVal_6099 Int)) (let ((.cse2 (let ((.cse3 (* main_~i~0 4))) (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| .cse3) v_ArrVal_6096) (+ 4 |c_main_~#distance~0.offset| .cse3) v_ArrVal_6098)))) (or (let ((.cse0 (store .cse2 (+ (* v_main_~x~0_1176 4) |c_main_~#distance~0.offset|) v_ArrVal_6099))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0))) (<= (select .cse0 (+ (* (select (select .cse1 |c_main_~#Dest~0.base|) (+ 4 |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|)) (+ (select (select .cse1 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 4)) (select .cse0 (+ (* 4 (select (select .cse1 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 4))) |c_main_~#distance~0.offset|)))))) (not (<= v_main_~x~0_1176 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|))) (not (<= c_~INFINITY~0 v_ArrVal_6098)) (not (<= v_ArrVal_6096 c_~INFINITY~0))))))) is different from false [2022-04-08 09:02:28,735 INFO L356 Elim1Store]: treesize reduction 414, result has 23.8 percent of original size [2022-04-08 09:02:28,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 34154 treesize of output 15154