/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/eureka_01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:41:41,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:41:41,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:41:41,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:41:41,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:41:41,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:41:41,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:41:41,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:41:41,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:41:41,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:41:41,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:41:41,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:41:41,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:41:41,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:41:41,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:41:41,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:41:41,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:41:41,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:41:41,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:41:41,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:41:41,457 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:41:41,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:41:41,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:41:41,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:41:41,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:41:41,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:41:41,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:41:41,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:41:41,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:41:41,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:41:41,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:41:41,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:41:41,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:41:41,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:41:41,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:41:41,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:41:41,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:41:41,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:41:41,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:41:41,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:41:41,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:41:41,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:41:41,473 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:41:41,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:41:41,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:41:41,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:41:41,481 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:41:41,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:41:41,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:41:41,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:41:41,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:41:41,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:41:41,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:41:41,483 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:41:41,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:41:41,483 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:41:41,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:41:41,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:41:41,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:41:41,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:41:41,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:41:41,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:41,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:41:41,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:41:41,484 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:41:41,484 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:41:41,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:41:41,484 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:41:41,484 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-15 05:41:41,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:41:41,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:41:41,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:41:41,706 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:41:41,707 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:41:41,708 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-15 05:41:41,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c752e19b/3210ce7e651a4b7d9d3bd0b40c7af62c/FLAG45a587099 [2022-04-15 05:41:42,121 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:41:42,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c [2022-04-15 05:41:42,129 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c752e19b/3210ce7e651a4b7d9d3bd0b40c7af62c/FLAG45a587099 [2022-04-15 05:41:42,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c752e19b/3210ce7e651a4b7d9d3bd0b40c7af62c [2022-04-15 05:41:42,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:41:42,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:41:42,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:42,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:41:42,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:41:42,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63aaa1bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42, skipping insertion in model container [2022-04-15 05:41:42,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:41:42,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:41:42,297 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-15 05:41:42,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:42,357 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:41:42,366 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-15 05:41:42,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:42,397 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:41:42,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42 WrapperNode [2022-04-15 05:41:42,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:42,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:41:42,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:41:42,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:41:42,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:41:42,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:41:42,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:41:42,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:41:42,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:42,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:42,475 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-15 05:41:42,485 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-15 05:41:42,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:41:42,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:41:42,517 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:41:42,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:41:42,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:41:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:41:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:41:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:41:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:41:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:41:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:41:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:41:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:41:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:41:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:41:42,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:41:42,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:41:42,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:41:42,587 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:41:42,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:41:42,812 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:41:42,817 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:41:42,817 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 05:41:42,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:42 BoogieIcfgContainer [2022-04-15 05:41:42,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:41:42,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:41:42,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:41:42,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:41:42,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:41:42" (1/3) ... [2022-04-15 05:41:42,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3db4c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:42, skipping insertion in model container [2022-04-15 05:41:42,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (2/3) ... [2022-04-15 05:41:42,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3db4c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:42, skipping insertion in model container [2022-04-15 05:41:42,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:42" (3/3) ... [2022-04-15 05:41:42,842 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2022-04-15 05:41:42,847 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:41:42,847 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:41:42,891 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:41:42,897 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-15 05:41:42,897 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:41:42,917 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-15 05:41:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:41:42,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:42,924 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:42,924 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:42,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1209894008, now seen corresponding path program 1 times [2022-04-15 05:41:42,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:42,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1766318875] [2022-04-15 05:41:42,946 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1209894008, now seen corresponding path program 2 times [2022-04-15 05:41:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:42,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846550081] [2022-04-15 05:41:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,163 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-15 05:41:43,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-15 05:41:43,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2022-04-15 05:41:43,165 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-15 05:41:43,165 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-15 05:41:43,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-15 05:41:43,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2022-04-15 05:41:43,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret22 := main(); {38#true} is VALID [2022-04-15 05:41:43,166 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-15 05:41:43,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2022-04-15 05:41:43,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-15 05:41:43,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 05:41:43,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-15 05:41:43,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 05:41:43,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-15 05:41:43,168 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-15 05:41:43,168 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-15 05:41:43,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-15 05:41:43,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-15 05:41:43,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-15 05:41:43,169 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-15 05:41:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:43,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846550081] [2022-04-15 05:41:43,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846550081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:43,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:43,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:43,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:43,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1766318875] [2022-04-15 05:41:43,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1766318875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:43,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:43,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429862874] [2022-04-15 05:41:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:43,178 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-15 05:41:43,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:43,181 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-15 05:41:43,210 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-15 05:41:43,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:41:43,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:43,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:41:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:41:43,235 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-15 05:41:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,334 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2022-04-15 05:41:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:41:43,335 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-15 05:41:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:43,336 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-15 05:41:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-04-15 05:41:43,349 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-15 05:41:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-04-15 05:41:43,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2022-04-15 05:41:43,456 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-15 05:41:43,490 INFO L225 Difference]: With dead ends: 61 [2022-04-15 05:41:43,490 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 05:41:43,497 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-15 05:41:43,518 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-15 05:41:43,520 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-15 05:41:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 05:41:43,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 05:41:43,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:43,548 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-15 05:41:43,549 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-15 05:41:43,549 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-15 05:41:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,552 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 05:41:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 05:41:43,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:43,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:43,552 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-15 05:41:43,553 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-15 05:41:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,555 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 05:41:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 05:41:43,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:43,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:43,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:43,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:43,556 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-15 05:41:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-15 05:41:43,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2022-04-15 05:41:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:43,559 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-15 05:41:43,559 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-15 05:41:43,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-15 05:41:43,600 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-15 05:41:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 05:41:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:41:43,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:43,601 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:43,602 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:41:43,602 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash -286620772, now seen corresponding path program 1 times [2022-04-15 05:41:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:43,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2122793644] [2022-04-15 05:41:43,604 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:43,604 INFO L85 PathProgramCache]: Analyzing trace with hash -286620772, now seen corresponding path program 2 times [2022-04-15 05:41:43,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:43,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448524715] [2022-04-15 05:41:43,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:43,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,769 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-15 05:41:43,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-15 05:41:43,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {288#true} {288#true} #107#return; {288#true} is VALID [2022-04-15 05:41:43,770 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-15 05:41:43,770 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-15 05:41:43,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-15 05:41:43,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #107#return; {288#true} is VALID [2022-04-15 05:41:43,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret22 := main(); {288#true} is VALID [2022-04-15 05:41:43,773 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-15 05:41:43,774 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-15 05:41:43,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-15 05:41:43,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {289#false} assume !(~i~0 < ~nodecount~0); {289#false} is VALID [2022-04-15 05:41:43,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-15 05:41:43,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#false} assume !(~i~0 < ~edgecount~0); {289#false} is VALID [2022-04-15 05:41:43,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-15 05:41:43,775 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-15 05:41:43,775 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-15 05:41:43,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {289#false} ~cond := #in~cond; {289#false} is VALID [2022-04-15 05:41:43,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {289#false} assume 0 == ~cond; {289#false} is VALID [2022-04-15 05:41:43,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-15 05:41:43,776 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-15 05:41:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:43,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448524715] [2022-04-15 05:41:43,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448524715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:43,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:43,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:43,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:43,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2122793644] [2022-04-15 05:41:43,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2122793644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:43,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:43,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:43,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935139018] [2022-04-15 05:41:43,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:43,779 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-15 05:41:43,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:43,779 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-15 05:41:43,793 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-15 05:41:43,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:41:43,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:43,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:41:43,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:41:43,795 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-15 05:41:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,926 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-15 05:41:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:41:43,926 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-15 05:41:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:43,927 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-15 05:41:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-15 05:41:43,930 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-15 05:41:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-15 05:41:43,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2022-04-15 05:41:43,998 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-15 05:41:44,000 INFO L225 Difference]: With dead ends: 54 [2022-04-15 05:41:44,000 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 05:41:44,000 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-15 05:41:44,003 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-15 05:41:44,006 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-15 05:41:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 05:41:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-15 05:41:44,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:44,020 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-15 05:41:44,021 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-15 05:41:44,022 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-15 05:41:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,026 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-15 05:41:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-15 05:41:44,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,027 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-15 05:41:44,027 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-15 05:41:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,033 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-15 05:41:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-15 05:41:44,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:44,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:44,034 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-15 05:41:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-04-15 05:41:44,035 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2022-04-15 05:41:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:44,035 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-04-15 05:41:44,036 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-15 05:41:44,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 37 transitions. [2022-04-15 05:41:44,074 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-15 05:41:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-15 05:41:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:41:44,076 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:44,077 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-15 05:41:44,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:41:44,077 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:44,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:44,078 INFO L85 PathProgramCache]: Analyzing trace with hash -344225220, now seen corresponding path program 1 times [2022-04-15 05:41:44,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1135246902] [2022-04-15 05:41:44,096 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:44,096 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:44,097 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash -344225220, now seen corresponding path program 2 times [2022-04-15 05:41:44,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:44,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354135536] [2022-04-15 05:41:44,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:44,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:44,216 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-15 05:41:44,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#true} assume true; {535#true} is VALID [2022-04-15 05:41:44,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {535#true} {535#true} #107#return; {535#true} is VALID [2022-04-15 05:41:44,217 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-15 05:41:44,217 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-15 05:41:44,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {535#true} assume true; {535#true} is VALID [2022-04-15 05:41:44,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {535#true} {535#true} #107#return; {535#true} is VALID [2022-04-15 05:41:44,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {535#true} call #t~ret22 := main(); {535#true} is VALID [2022-04-15 05:41:44,220 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-15 05:41:44,221 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-15 05:41:44,221 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-15 05:41:44,222 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-15 05:41:44,222 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-15 05:41:44,223 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-15 05:41:44,223 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-15 05:41:44,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#false} ~i~0 := 0; {536#false} is VALID [2022-04-15 05:41:44,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#false} assume !(~i~0 < ~edgecount~0); {536#false} is VALID [2022-04-15 05:41:44,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {536#false} ~i~0 := 0; {536#false} is VALID [2022-04-15 05:41:44,224 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-15 05:41:44,224 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-15 05:41:44,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#false} ~cond := #in~cond; {536#false} is VALID [2022-04-15 05:41:44,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {536#false} assume 0 == ~cond; {536#false} is VALID [2022-04-15 05:41:44,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {536#false} assume !false; {536#false} is VALID [2022-04-15 05:41:44,225 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-15 05:41:44,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:44,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354135536] [2022-04-15 05:41:44,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354135536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:44,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:44,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:44,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:44,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1135246902] [2022-04-15 05:41:44,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1135246902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:44,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:44,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:44,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615419673] [2022-04-15 05:41:44,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:44,228 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-15 05:41:44,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:44,228 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-15 05:41:44,246 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-15 05:41:44,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:41:44,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:41:44,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:41:44,248 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-15 05:41:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,481 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-15 05:41:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:41:44,482 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-15 05:41:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:44,482 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-15 05:41:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-15 05:41:44,486 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-15 05:41:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-15 05:41:44,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-15 05:41:44,565 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-15 05:41:44,568 INFO L225 Difference]: With dead ends: 61 [2022-04-15 05:41:44,568 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 05:41:44,569 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-15 05:41:44,571 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-15 05:41:44,574 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-15 05:41:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 05:41:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2022-04-15 05:41:44,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:44,585 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-15 05:41:44,585 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-15 05:41:44,586 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-15 05:41:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,589 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-15 05:41:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-15 05:41:44,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,593 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-15 05:41:44,593 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-15 05:41:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,598 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-15 05:41:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-15 05:41:44,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:44,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:44,600 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-15 05:41:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 05:41:44,601 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2022-04-15 05:41:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:44,601 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 05:41:44,601 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-15 05:41:44,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-15 05:41:44,636 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-15 05:41:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 05:41:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:41:44,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:44,637 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-15 05:41:44,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:41:44,639 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash -522475142, now seen corresponding path program 1 times [2022-04-15 05:41:44,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825045501] [2022-04-15 05:41:44,646 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:44,646 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:44,646 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash -522475142, now seen corresponding path program 2 times [2022-04-15 05:41:44,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:44,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141433865] [2022-04-15 05:41:44,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:44,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:44,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:44,700 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-15 05:41:44,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-15 05:41:44,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {827#true} {827#true} #107#return; {827#true} is VALID [2022-04-15 05:41:44,701 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-15 05:41:44,701 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-15 05:41:44,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-15 05:41:44,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #107#return; {827#true} is VALID [2022-04-15 05:41:44,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret22 := main(); {827#true} is VALID [2022-04-15 05:41:44,704 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-15 05:41:44,704 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-15 05:41:44,704 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-15 05:41:44,705 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-15 05:41:44,705 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-15 05:41:44,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {832#(<= 20 main_~edgecount~0)} ~i~0 := 0; {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:44,706 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-15 05:41:44,706 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-15 05:41:44,706 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-15 05:41:44,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {828#false} assume !(~i~0 < ~nodecount~0); {828#false} is VALID [2022-04-15 05:41:44,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#false} ~i~0 := 0; {828#false} is VALID [2022-04-15 05:41:44,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {828#false} assume !(~i~0 < ~edgecount~0); {828#false} is VALID [2022-04-15 05:41:44,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {828#false} ~i~0 := 0; {828#false} is VALID [2022-04-15 05:41:44,707 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-15 05:41:44,707 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-15 05:41:44,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2022-04-15 05:41:44,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0 == ~cond; {828#false} is VALID [2022-04-15 05:41:44,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2022-04-15 05:41:44,708 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-15 05:41:44,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:44,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141433865] [2022-04-15 05:41:44,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141433865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:44,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:44,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:44,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:44,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825045501] [2022-04-15 05:41:44,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825045501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:44,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:44,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649305165] [2022-04-15 05:41:44,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:44,709 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-15 05:41:44,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:44,710 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-15 05:41:44,725 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-15 05:41:44,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:41:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:41:44,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:41:44,726 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-15 05:41:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,873 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-15 05:41:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:41:44,873 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-15 05:41:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:44,873 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-15 05:41:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 05:41:44,874 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-15 05:41:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 05:41:44,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 05:41:44,929 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-15 05:41:44,929 INFO L225 Difference]: With dead ends: 55 [2022-04-15 05:41:44,929 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 05:41:44,930 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-15 05:41:44,930 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-15 05:41:44,931 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-15 05:41:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 05:41:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-15 05:41:44,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:44,945 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-15 05:41:44,945 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-15 05:41:44,945 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-15 05:41:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,946 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 05:41:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-15 05:41:44,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,947 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-15 05:41:44,947 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-15 05:41:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,948 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 05:41:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-15 05:41:44,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:44,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:44,948 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-15 05:41:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-15 05:41:44,949 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2022-04-15 05:41:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:44,949 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-15 05:41:44,949 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-15 05:41:44,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-15 05:41:44,985 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-15 05:41:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 05:41:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:41:44,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:44,986 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-15 05:41:44,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 05:41:44,987 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:44,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1086024003, now seen corresponding path program 1 times [2022-04-15 05:41:44,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1284168151] [2022-04-15 05:41:44,989 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:44,989 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:44,990 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:44,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1086024003, now seen corresponding path program 2 times [2022-04-15 05:41:44,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:44,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250039460] [2022-04-15 05:41:44,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:45,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:45,052 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-15 05:41:45,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {1087#true} assume true; {1087#true} is VALID [2022-04-15 05:41:45,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1087#true} {1087#true} #107#return; {1087#true} is VALID [2022-04-15 05:41:45,053 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-15 05:41:45,053 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-15 05:41:45,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {1087#true} assume true; {1087#true} is VALID [2022-04-15 05:41:45,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1087#true} {1087#true} #107#return; {1087#true} is VALID [2022-04-15 05:41:45,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {1087#true} call #t~ret22 := main(); {1087#true} is VALID [2022-04-15 05:41:45,055 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-15 05:41:45,056 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-15 05:41:45,056 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-15 05:41:45,056 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-15 05:41:45,056 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-15 05:41:45,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {1092#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:45,057 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-15 05:41:45,059 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-15 05:41:45,060 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-15 05:41:45,064 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-15 05:41:45,064 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-15 05:41:45,065 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-15 05:41:45,065 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-15 05:41:45,065 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-15 05:41:45,066 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-15 05:41:45,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#false} ~i~0 := 0; {1088#false} is VALID [2022-04-15 05:41:45,066 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-15 05:41:45,066 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-15 05:41:45,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {1088#false} ~cond := #in~cond; {1088#false} is VALID [2022-04-15 05:41:45,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {1088#false} assume 0 == ~cond; {1088#false} is VALID [2022-04-15 05:41:45,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2022-04-15 05:41:45,067 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-15 05:41:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:45,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250039460] [2022-04-15 05:41:45,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250039460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:45,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:45,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:45,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1284168151] [2022-04-15 05:41:45,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1284168151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:45,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:45,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869217517] [2022-04-15 05:41:45,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:45,068 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-15 05:41:45,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:45,069 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-15 05:41:45,090 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-15 05:41:45,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:41:45,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:45,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:41:45,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:41:45,091 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-15 05:41:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:45,259 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-15 05:41:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:41:45,260 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-15 05:41:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:45,260 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-15 05:41:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 05:41:45,261 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-15 05:41:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 05:41:45,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 05:41:45,310 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-15 05:41:45,311 INFO L225 Difference]: With dead ends: 58 [2022-04-15 05:41:45,311 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 05:41:45,312 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-15 05:41:45,312 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:45,313 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.0s Time] [2022-04-15 05:41:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 05:41:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-04-15 05:41:45,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:45,349 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-15 05:41:45,350 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-15 05:41:45,350 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-15 05:41:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:45,352 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-15 05:41:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-15 05:41:45,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:45,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:45,352 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-15 05:41:45,353 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-15 05:41:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:45,354 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-15 05:41:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-15 05:41:45,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:45,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:45,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:45,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:45,355 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-15 05:41:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-15 05:41:45,356 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2022-04-15 05:41:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:45,358 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-15 05:41:45,358 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-15 05:41:45,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-15 05:41:45,404 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-15 05:41:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-15 05:41:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:41:45,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:45,405 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-15 05:41:45,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 05:41:45,406 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:45,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash -669976079, now seen corresponding path program 1 times [2022-04-15 05:41:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:45,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1789278450] [2022-04-15 05:41:45,411 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:45,411 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:45,411 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:45,411 INFO L85 PathProgramCache]: Analyzing trace with hash -669976079, now seen corresponding path program 2 times [2022-04-15 05:41:45,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:45,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889313349] [2022-04-15 05:41:45,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:45,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:45,513 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-15 05:41:45,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-15 05:41:45,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-15 05:41:45,514 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-15 05:41:45,514 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-15 05:41:45,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-15 05:41:45,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-15 05:41:45,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-15 05:41:45,516 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-15 05:41:45,516 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-15 05:41:45,517 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-15 05:41:45,517 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-15 05:41:45,518 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-15 05:41:45,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-15 05:41:45,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1380#false} is VALID [2022-04-15 05:41:45,518 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-15 05:41:45,518 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-15 05:41:45,518 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-15 05:41:45,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#false} assume !(~j~0 < ~edgecount~0); {1380#false} is VALID [2022-04-15 05:41:45,518 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-15 05:41:45,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#false} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-15 05:41:45,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-15 05:41:45,519 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-15 05:41:45,519 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-15 05:41:45,519 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-15 05:41:45,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-15 05:41:45,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-15 05:41:45,519 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-15 05:41:45,519 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-15 05:41:45,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-15 05:41:45,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-15 05:41:45,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-15 05:41:45,520 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-15 05:41:45,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:45,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889313349] [2022-04-15 05:41:45,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889313349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:45,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500361969] [2022-04-15 05:41:45,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:45,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:45,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:45,522 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-15 05:41:45,543 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-15 05:41:45,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:45,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:45,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:41:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:45,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:45,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-15 05:41:45,858 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-15 05:41:45,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-15 05:41:45,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-15 05:41:45,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-15 05:41:45,860 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-15 05:41:45,861 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-15 05:41:45,861 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-15 05:41:45,861 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-15 05:41:45,862 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-15 05:41:45,862 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-15 05:41:45,862 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-15 05:41:45,863 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-15 05:41:45,863 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-15 05:41:45,864 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-15 05:41:45,864 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-15 05:41:45,864 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-15 05:41:45,865 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-15 05:41:45,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-15 05:41:45,865 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-15 05:41:45,865 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-15 05:41:45,865 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-15 05:41:45,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-15 05:41:45,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-15 05:41:45,866 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-15 05:41:45,866 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-15 05:41:45,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-15 05:41:45,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-15 05:41:45,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-15 05:41:45,867 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-15 05:41:45,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:46,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-15 05:41:46,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-15 05:41:46,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-15 05:41:46,008 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-15 05:41:46,008 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-15 05:41:46,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-15 05:41:46,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-15 05:41:46,008 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-15 05:41:46,008 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-15 05:41:46,008 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-15 05:41:46,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-15 05:41:46,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {1510#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-15 05:41:46,009 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-15 05:41:46,010 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-15 05:41:46,010 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-15 05:41:46,010 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-15 05:41:46,011 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-15 05:41:46,011 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-15 05:41:46,011 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-15 05:41:46,012 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-15 05:41:46,012 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-15 05:41:46,012 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-15 05:41:46,012 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-15 05:41:46,014 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-15 05:41:46,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-15 05:41:46,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-15 05:41:46,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-15 05:41:46,015 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-15 05:41:46,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-15 05:41:46,015 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-15 05:41:46,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500361969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:46,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:46,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-15 05:41:46,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:46,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1789278450] [2022-04-15 05:41:46,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1789278450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:46,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:46,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:46,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724734324] [2022-04-15 05:41:46,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:46,017 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-15 05:41:46,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:46,017 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-15 05:41:46,036 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-15 05:41:46,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:41:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:46,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:41:46,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-15 05:41:46,047 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-15 05:41:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:46,279 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-15 05:41:46,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:41:46,279 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-15 05:41:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:46,279 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-15 05:41:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 05:41:46,282 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-15 05:41:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 05:41:46,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-15 05:41:46,330 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-15 05:41:46,332 INFO L225 Difference]: With dead ends: 63 [2022-04-15 05:41:46,332 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 05:41:46,333 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-15 05:41:46,333 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-15 05:41:46,334 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-15 05:41:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 05:41:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-04-15 05:41:46,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:46,352 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-15 05:41:46,352 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-15 05:41:46,352 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-15 05:41:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:46,355 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-15 05:41:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-15 05:41:46,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:46,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:46,355 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-15 05:41:46,355 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-15 05:41:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:46,356 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-15 05:41:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-15 05:41:46,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:46,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:46,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:46,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:46,357 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-15 05:41:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-15 05:41:46,358 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 29 [2022-04-15 05:41:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:46,358 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-15 05:41:46,358 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-15 05:41:46,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-15 05:41:46,398 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-15 05:41:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-15 05:41:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:41:46,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:46,398 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-15 05:41:46,424 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-15 05:41:46,618 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-15 05:41:46,618 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1490218863, now seen corresponding path program 3 times [2022-04-15 05:41:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:46,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1659300239] [2022-04-15 05:41:46,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:46,622 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:46,622 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:46,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1490218863, now seen corresponding path program 4 times [2022-04-15 05:41:46,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:46,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896328722] [2022-04-15 05:41:46,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:46,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:46,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:46,709 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-15 05:41:46,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-15 05:41:46,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-15 05:41:46,710 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-15 05:41:46,710 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-15 05:41:46,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-15 05:41:46,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-15 05:41:46,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {1848#true} call #t~ret22 := main(); {1848#true} is VALID [2022-04-15 05:41:46,712 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-15 05:41:46,713 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-15 05:41:46,713 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-15 05:41:46,714 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-15 05:41:46,714 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-15 05:41:46,714 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-15 05:41:46,715 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-15 05:41:46,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-15 05:41:46,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-15 05:41:46,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1849#false} is VALID [2022-04-15 05:41:46,715 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-15 05:41:46,715 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-15 05:41:46,715 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-15 05:41:46,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {1849#false} assume !(~j~0 < ~edgecount~0); {1849#false} is VALID [2022-04-15 05:41:46,716 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-15 05:41:46,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-15 05:41:46,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-15 05:41:46,717 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-15 05:41:46,717 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-15 05:41:46,717 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-15 05:41:46,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {1849#false} assume !(~i~0 < ~edgecount~0); {1849#false} is VALID [2022-04-15 05:41:46,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-15 05:41:46,717 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-15 05:41:46,717 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-15 05:41:46,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {1849#false} ~cond := #in~cond; {1849#false} is VALID [2022-04-15 05:41:46,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {1849#false} assume 0 == ~cond; {1849#false} is VALID [2022-04-15 05:41:46,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {1849#false} assume !false; {1849#false} is VALID [2022-04-15 05:41:46,727 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-15 05:41:46,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:46,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896328722] [2022-04-15 05:41:46,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896328722] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:46,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649307622] [2022-04-15 05:41:46,728 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:46,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:46,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:46,744 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-15 05:41:46,799 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-15 05:41:46,862 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:46,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:46,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 05:41:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:46,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:46,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {1848#true} call ULTIMATE.init(); {1848#true} is VALID [2022-04-15 05:41:46,943 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-15 05:41:46,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-15 05:41:46,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-15 05:41:46,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {1848#true} call #t~ret22 := main(); {1848#true} is VALID [2022-04-15 05:41:46,944 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-15 05:41:46,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {1848#true} assume !!(~i~0 < ~nodecount~0); {1848#true} is VALID [2022-04-15 05:41:46,945 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-15 05:41:46,945 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-15 05:41:46,946 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-15 05:41:46,946 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-15 05:41:46,947 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-15 05:41:46,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-15 05:41:46,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-15 05:41:46,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1849#false} is VALID [2022-04-15 05:41:46,947 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-15 05:41:46,947 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-15 05:41:46,947 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-15 05:41:46,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {1849#false} assume !(~j~0 < ~edgecount~0); {1849#false} is VALID [2022-04-15 05:41:46,947 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-15 05:41:46,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-15 05:41:46,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-15 05:41:46,948 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-15 05:41:46,948 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-15 05:41:46,948 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-15 05:41:46,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {1849#false} assume !(~i~0 < ~edgecount~0); {1849#false} is VALID [2022-04-15 05:41:46,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-15 05:41:46,948 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-15 05:41:46,948 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-15 05:41:46,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {1849#false} ~cond := #in~cond; {1849#false} is VALID [2022-04-15 05:41:46,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {1849#false} assume 0 == ~cond; {1849#false} is VALID [2022-04-15 05:41:46,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {1849#false} assume !false; {1849#false} is VALID [2022-04-15 05:41:46,949 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-15 05:41:46,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:41:46,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649307622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:46,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:41:46,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-15 05:41:46,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:46,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1659300239] [2022-04-15 05:41:46,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1659300239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:46,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:46,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:46,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789429226] [2022-04-15 05:41:46,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:46,950 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-15 05:41:46,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:46,950 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-15 05:41:46,967 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-15 05:41:46,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:41:46,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:46,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:41:46,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 05:41:46,968 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-15 05:41:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:47,051 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-15 05:41:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:41:47,052 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-15 05:41:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:47,052 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-15 05:41:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-15 05:41:47,053 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-15 05:41:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-15 05:41:47,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-15 05:41:47,100 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-15 05:41:47,101 INFO L225 Difference]: With dead ends: 65 [2022-04-15 05:41:47,101 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 05:41:47,101 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-15 05:41:47,102 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-15 05:41:47,102 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-15 05:41:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 05:41:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 05:41:47,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:47,124 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-15 05:41:47,125 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-15 05:41:47,125 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-15 05:41:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:47,126 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-15 05:41:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-15 05:41:47,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:47,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:47,126 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-15 05:41:47,126 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-15 05:41:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:47,127 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-15 05:41:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-15 05:41:47,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:47,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:47,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:47,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:47,128 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-15 05:41:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-15 05:41:47,128 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 32 [2022-04-15 05:41:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:47,129 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-15 05:41:47,129 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-15 05:41:47,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 43 transitions. [2022-04-15 05:41:47,169 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-15 05:41:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-15 05:41:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:41:47,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:47,170 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-15 05:41:47,201 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-15 05:41:47,384 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-15 05:41:47,385 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1271364145, now seen corresponding path program 1 times [2022-04-15 05:41:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:47,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [584832932] [2022-04-15 05:41:47,391 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:47,391 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:47,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1271364145, now seen corresponding path program 2 times [2022-04-15 05:41:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:47,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980649682] [2022-04-15 05:41:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:47,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:47,496 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-15 05:41:47,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-15 05:41:47,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-15 05:41:47,498 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-15 05:41:47,498 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-15 05:41:47,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-15 05:41:47,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-15 05:41:47,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-15 05:41:47,500 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-15 05:41:47,500 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-15 05:41:47,501 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-15 05:41:47,501 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-15 05:41:47,501 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-15 05:41:47,502 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-15 05:41:47,502 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-15 05:41:47,503 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-15 05:41:47,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,503 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-15 05:41:47,503 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-15 05:41:47,503 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-15 05:41:47,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-15 05:41:47,503 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-15 05:41:47,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-15 05:41:47,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,504 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-15 05:41:47,504 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-15 05:41:47,504 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-15 05:41:47,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-15 05:41:47,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,504 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-15 05:41:47,504 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-15 05:41:47,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-15 05:41:47,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-15 05:41:47,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-15 05:41:47,504 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-15 05:41:47,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:47,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980649682] [2022-04-15 05:41:47,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980649682] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:47,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563922810] [2022-04-15 05:41:47,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:47,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:47,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:47,520 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-15 05:41:47,530 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-15 05:41:47,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:47,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:47,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:41:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:47,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:47,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2233#true} is VALID [2022-04-15 05:41:47,765 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-15 05:41:47,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-15 05:41:47,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-15 05:41:47,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-15 05:41:47,767 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-15 05:41:47,768 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-15 05:41:47,768 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-15 05:41:47,768 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-15 05:41:47,769 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-15 05:41:47,769 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-15 05:41:47,769 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-15 05:41:47,770 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-15 05:41:47,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,770 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-15 05:41:47,770 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-15 05:41:47,770 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-15 05:41:47,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-15 05:41:47,770 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-15 05:41:47,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-15 05:41:47,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,771 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-15 05:41:47,771 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-15 05:41:47,771 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-15 05:41:47,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-15 05:41:47,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,771 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-15 05:41:47,771 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-15 05:41:47,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-15 05:41:47,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-15 05:41:47,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-15 05:41:47,772 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-15 05:41:47,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:47,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-15 05:41:47,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-15 05:41:47,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-15 05:41:47,916 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-15 05:41:47,916 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-15 05:41:47,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-15 05:41:47,916 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-15 05:41:47,916 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-15 05:41:47,917 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-15 05:41:47,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-15 05:41:47,917 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-15 05:41:47,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-15 05:41:47,917 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-15 05:41:47,917 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-15 05:41:47,917 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-15 05:41:47,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-15 05:41:47,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {2398#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-15 05:41:47,918 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-15 05:41:47,918 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-15 05:41:47,919 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-15 05:41:47,919 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-15 05:41:47,919 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-15 05:41:47,919 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-15 05:41:47,921 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-15 05:41:47,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-15 05:41:47,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-15 05:41:47,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-15 05:41:47,922 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-15 05:41:47,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2233#true} is VALID [2022-04-15 05:41:47,922 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-15 05:41:47,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563922810] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:47,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:47,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-15 05:41:47,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:47,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [584832932] [2022-04-15 05:41:47,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [584832932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:47,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:47,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:47,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795123762] [2022-04-15 05:41:47,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:47,923 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-15 05:41:47,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:47,923 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-15 05:41:47,941 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-15 05:41:47,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:41:47,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:47,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:41:47,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:41:47,942 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-15 05:41:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:48,195 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-15 05:41:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:41:48,195 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-15 05:41:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:48,195 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-15 05:41:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-15 05:41:48,196 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-15 05:41:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-15 05:41:48,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-15 05:41:48,245 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-15 05:41:48,245 INFO L225 Difference]: With dead ends: 66 [2022-04-15 05:41:48,245 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 05:41:48,246 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-15 05:41:48,246 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-15 05:41:48,246 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-15 05:41:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 05:41:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-15 05:41:48,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:48,270 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-15 05:41:48,271 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-15 05:41:48,271 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-15 05:41:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:48,272 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-15 05:41:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-15 05:41:48,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:48,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:48,272 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-15 05:41:48,272 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-15 05:41:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:48,273 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-15 05:41:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-15 05:41:48,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:48,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:48,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:48,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:48,274 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-15 05:41:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-04-15 05:41:48,274 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2022-04-15 05:41:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:48,274 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-04-15 05:41:48,275 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-15 05:41:48,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 46 transitions. [2022-04-15 05:41:48,315 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-15 05:41:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-15 05:41:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 05:41:48,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:48,316 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-15 05:41:48,332 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-15 05:41:48,529 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-15 05:41:48,530 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1380320561, now seen corresponding path program 3 times [2022-04-15 05:41:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:48,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1784690152] [2022-04-15 05:41:48,533 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:48,534 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:48,534 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1380320561, now seen corresponding path program 4 times [2022-04-15 05:41:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:48,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778963769] [2022-04-15 05:41:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:48,596 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-15 05:41:48,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-15 05:41:48,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-15 05:41:48,598 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-15 05:41:48,598 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-15 05:41:48,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-15 05:41:48,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-15 05:41:48,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-15 05:41:48,601 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-15 05:41:48,602 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-15 05:41:48,603 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-15 05:41:48,603 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-15 05:41:48,603 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-15 05:41:48,604 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-15 05:41:48,604 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-15 05:41:48,605 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-15 05:41:48,605 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-15 05:41:48,605 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-15 05:41:48,606 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-15 05:41:48,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-15 05:41:48,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2742#false} is VALID [2022-04-15 05:41:48,606 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-15 05:41:48,606 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-15 05:41:48,606 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-15 05:41:48,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {2742#false} assume !(~j~0 < ~edgecount~0); {2742#false} is VALID [2022-04-15 05:41:48,606 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-15 05:41:48,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {2742#false} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-15 05:41:48,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-15 05:41:48,606 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-15 05:41:48,607 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-15 05:41:48,607 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-15 05:41:48,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-15 05:41:48,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-15 05:41:48,607 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-15 05:41:48,607 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-15 05:41:48,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-15 05:41:48,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-15 05:41:48,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-15 05:41:48,608 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-15 05:41:48,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778963769] [2022-04-15 05:41:48,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778963769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830449758] [2022-04-15 05:41:48,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:48,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:48,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:48,610 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-15 05:41:48,611 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-15 05:41:48,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:48,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:48,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:41:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:48,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:48,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2741#true} is VALID [2022-04-15 05:41:48,838 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-15 05:41:48,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-15 05:41:48,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-15 05:41:48,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-15 05:41:48,840 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-15 05:41:48,840 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-15 05:41:48,840 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-15 05:41:48,840 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-15 05:41:48,841 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-15 05:41:48,841 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-15 05:41:48,841 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-15 05:41:48,842 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-15 05:41:48,842 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-15 05:41:48,842 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-15 05:41:48,842 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-15 05:41:48,843 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-15 05:41:48,843 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-15 05:41:48,843 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-15 05:41:48,844 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-15 05:41:48,844 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-15 05:41:48,845 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-15 05:41:48,845 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-15 05:41:48,845 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-15 05:41:48,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-15 05:41:48,845 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-15 05:41:48,846 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-15 05:41:48,846 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-15 05:41:48,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-15 05:41:48,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-15 05:41:48,846 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-15 05:41:48,846 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-15 05:41:48,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-15 05:41:48,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-15 05:41:48,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-15 05:41:48,846 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-15 05:41:48,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:49,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-15 05:41:49,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-15 05:41:49,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-15 05:41:49,003 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-15 05:41:49,003 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-15 05:41:49,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-15 05:41:49,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-15 05:41:49,003 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-15 05:41:49,003 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-15 05:41:49,003 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-15 05:41:49,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-15 05:41:49,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {2892#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-15 05:41:49,004 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-15 05:41:49,004 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-15 05:41:49,005 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-15 05:41:49,005 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-15 05:41:49,005 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-15 05:41:49,006 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-15 05:41:49,006 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-15 05:41:49,006 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-15 05:41:49,007 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-15 05:41:49,008 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-15 05:41:49,008 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-15 05:41:49,008 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-15 05:41:49,009 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-15 05:41:49,009 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-15 05:41:49,009 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-15 05:41:49,009 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-15 05:41:49,010 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-15 05:41:49,011 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-15 05:41:49,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-15 05:41:49,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-15 05:41:49,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-15 05:41:49,012 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-15 05:41:49,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2741#true} is VALID [2022-04-15 05:41:49,012 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-15 05:41:49,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830449758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:49,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:49,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-15 05:41:49,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:49,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1784690152] [2022-04-15 05:41:49,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1784690152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:49,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:49,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:41:49,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061967143] [2022-04-15 05:41:49,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:49,013 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-15 05:41:49,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:49,014 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-15 05:41:49,040 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-15 05:41:49,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:41:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:49,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:41:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:41:49,041 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-15 05:41:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,246 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-15 05:41:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:41:49,247 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-15 05:41:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:49,247 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-15 05:41:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-15 05:41:49,248 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-15 05:41:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-15 05:41:49,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-15 05:41:49,310 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-15 05:41:49,310 INFO L225 Difference]: With dead ends: 69 [2022-04-15 05:41:49,310 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 05:41:49,311 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-15 05:41:49,311 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 05:41:49,311 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-15 05:41:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 05:41:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-15 05:41:49,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:49,368 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-15 05:41:49,368 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-15 05:41:49,370 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-15 05:41:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,373 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 05:41:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 05:41:49,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:49,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:49,373 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-15 05:41:49,374 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-15 05:41:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,375 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 05:41:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 05:41:49,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:49,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:49,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:49,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:49,375 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-15 05:41:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-15 05:41:49,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 35 [2022-04-15 05:41:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:49,376 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-15 05:41:49,377 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-15 05:41:49,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 49 transitions. [2022-04-15 05:41:49,437 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-15 05:41:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-15 05:41:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 05:41:49,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:49,439 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-15 05:41:49,457 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-15 05:41:49,639 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-15 05:41:49,639 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash 385921679, now seen corresponding path program 5 times [2022-04-15 05:41:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:49,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1962984019] [2022-04-15 05:41:49,650 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:49,650 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:49,650 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:49,650 INFO L85 PathProgramCache]: Analyzing trace with hash 385921679, now seen corresponding path program 6 times [2022-04-15 05:41:49,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:49,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627201668] [2022-04-15 05:41:49,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:49,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:49,742 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-15 05:41:49,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-15 05:41:49,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-15 05:41:49,744 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-15 05:41:49,744 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-15 05:41:49,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-15 05:41:49,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-15 05:41:49,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-15 05:41:49,746 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-15 05:41:49,747 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-15 05:41:49,747 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-15 05:41:49,748 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-15 05:41:49,748 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-15 05:41:49,749 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-15 05:41:49,749 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-15 05:41:49,749 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-15 05:41:49,750 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-15 05:41:49,750 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-15 05:41:49,751 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-15 05:41:49,751 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-15 05:41:49,752 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-15 05:41:49,752 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-15 05:41:49,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-15 05:41:49,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3289#false} is VALID [2022-04-15 05:41:49,752 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-15 05:41:49,753 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-15 05:41:49,753 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-15 05:41:49,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#false} assume !(~j~0 < ~edgecount~0); {3289#false} is VALID [2022-04-15 05:41:49,753 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-15 05:41:49,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#false} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-15 05:41:49,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-15 05:41:49,753 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-15 05:41:49,753 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-15 05:41:49,753 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-15 05:41:49,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-15 05:41:49,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-15 05:41:49,754 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-15 05:41:49,754 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-15 05:41:49,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-15 05:41:49,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-15 05:41:49,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-15 05:41:49,755 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-15 05:41:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:49,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627201668] [2022-04-15 05:41:49,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627201668] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:49,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015168638] [2022-04-15 05:41:49,755 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:41:49,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:49,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:49,772 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-15 05:41:49,827 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-15 05:41:49,903 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:41:49,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:49,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:41:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:49,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:50,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3288#true} is VALID [2022-04-15 05:41:50,122 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-15 05:41:50,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-15 05:41:50,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-15 05:41:50,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-15 05:41:50,125 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-15 05:41:50,125 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-15 05:41:50,125 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-15 05:41:50,126 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-15 05:41:50,126 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-15 05:41:50,126 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-15 05:41:50,127 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-15 05:41:50,127 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-15 05:41:50,127 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-15 05:41:50,127 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-15 05:41:50,128 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-15 05:41:50,128 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-15 05:41:50,128 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-15 05:41:50,129 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-15 05:41:50,129 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-15 05:41:50,130 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-15 05:41:50,130 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-15 05:41:50,131 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-15 05:41:50,131 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-15 05:41:50,132 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-15 05:41:50,132 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-15 05:41:50,132 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-15 05:41:50,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-15 05:41:50,133 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-15 05:41:50,133 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-15 05:41:50,133 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-15 05:41:50,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-15 05:41:50,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-15 05:41:50,133 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-15 05:41:50,133 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-15 05:41:50,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-15 05:41:50,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-15 05:41:50,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-15 05:41:50,134 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-15 05:41:50,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:50,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-15 05:41:50,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-15 05:41:50,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-15 05:41:50,312 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-15 05:41:50,312 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-15 05:41:50,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-15 05:41:50,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-15 05:41:50,312 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-15 05:41:50,312 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-15 05:41:50,312 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-15 05:41:50,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-15 05:41:50,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {3449#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-15 05:41:50,313 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-15 05:41:50,314 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-15 05:41:50,314 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-15 05:41:50,315 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-15 05:41:50,315 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-15 05:41:50,315 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-15 05:41:50,316 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-15 05:41:50,316 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-15 05:41:50,316 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-15 05:41:50,317 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-15 05:41:50,317 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-15 05:41:50,317 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-15 05:41:50,318 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-15 05:41:50,318 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-15 05:41:50,318 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-15 05:41:50,319 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-15 05:41:50,319 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-15 05:41:50,319 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-15 05:41:50,319 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-15 05:41:50,320 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-15 05:41:50,322 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-15 05:41:50,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-15 05:41:50,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-15 05:41:50,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-15 05:41:50,322 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-15 05:41:50,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3288#true} is VALID [2022-04-15 05:41:50,323 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-15 05:41:50,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015168638] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:50,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:50,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-04-15 05:41:50,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:50,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1962984019] [2022-04-15 05:41:50,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1962984019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:50,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:50,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:41:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388971537] [2022-04-15 05:41:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:50,324 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-15 05:41:50,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:50,324 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-15 05:41:50,353 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-15 05:41:50,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:41:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:50,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:41:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:41:50,354 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-15 05:41:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:50,644 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-15 05:41:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:41:50,645 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-15 05:41:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:50,645 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-15 05:41:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-15 05:41:50,647 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-15 05:41:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-15 05:41:50,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-04-15 05:41:50,707 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-15 05:41:50,708 INFO L225 Difference]: With dead ends: 72 [2022-04-15 05:41:50,708 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 05:41:50,709 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-15 05:41:50,709 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-15 05:41:50,709 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-15 05:41:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 05:41:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-04-15 05:41:50,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:50,759 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-15 05:41:50,759 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-15 05:41:50,759 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-15 05:41:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:50,760 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-15 05:41:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-15 05:41:50,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:50,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:50,761 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-15 05:41:50,761 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-15 05:41:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:50,761 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-15 05:41:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-15 05:41:50,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:50,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:50,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:50,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:50,762 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-15 05:41:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-04-15 05:41:50,763 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 38 [2022-04-15 05:41:50,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:50,763 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-04-15 05:41:50,763 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-15 05:41:50,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 52 transitions. [2022-04-15 05:41:50,824 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-15 05:41:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-04-15 05:41:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 05:41:50,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:50,825 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-15 05:41:50,843 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-15 05:41:51,025 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-15 05:41:51,026 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:51,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1361731471, now seen corresponding path program 7 times [2022-04-15 05:41:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:51,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481137576] [2022-04-15 05:41:51,034 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:51,034 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:51,034 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1361731471, now seen corresponding path program 8 times [2022-04-15 05:41:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:51,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270676528] [2022-04-15 05:41:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:51,101 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-15 05:41:51,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-15 05:41:51,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-15 05:41:51,102 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-15 05:41:51,102 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-15 05:41:51,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-15 05:41:51,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-15 05:41:51,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-15 05:41:51,106 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-15 05:41:51,107 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-15 05:41:51,107 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-15 05:41:51,107 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-15 05:41:51,108 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-15 05:41:51,108 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-15 05:41:51,108 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-15 05:41:51,108 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-15 05:41:51,108 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-15 05:41:51,109 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-15 05:41:51,109 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-15 05:41:51,109 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-15 05:41:51,109 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-15 05:41:51,110 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-15 05:41:51,110 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-15 05:41:51,110 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-15 05:41:51,110 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-15 05:41:51,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:51,111 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-15 05:41:51,111 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-15 05:41:51,112 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-15 05:41:51,112 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-15 05:41:51,113 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-15 05:41:51,113 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-15 05:41:51,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {3875#false} assume !(~i~0 < ~nodecount~0); {3875#false} is VALID [2022-04-15 05:41:51,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-15 05:41:51,113 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-15 05:41:51,113 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-15 05:41:51,113 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-15 05:41:51,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {3875#false} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-15 05:41:51,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-15 05:41:51,113 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-15 05:41:51,113 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-15 05:41:51,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-15 05:41:51,114 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-15 05:41:51,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-15 05:41:51,114 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-15 05:41:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:51,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270676528] [2022-04-15 05:41:51,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270676528] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:51,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728960679] [2022-04-15 05:41:51,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:51,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:51,115 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-15 05:41:51,116 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-15 05:41:51,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:51,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:51,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:41:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:51,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:51,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3874#true} is VALID [2022-04-15 05:41:51,362 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-15 05:41:51,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-15 05:41:51,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-15 05:41:51,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-15 05:41:51,364 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-15 05:41:51,365 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-15 05:41:51,365 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-15 05:41:51,365 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-15 05:41:51,366 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-15 05:41:51,366 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-15 05:41:51,366 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-15 05:41:51,366 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-15 05:41:51,367 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-15 05:41:51,367 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-15 05:41:51,367 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-15 05:41:51,367 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-15 05:41:51,368 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-15 05:41:51,368 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-15 05:41:51,368 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-15 05:41:51,368 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-15 05:41:51,369 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-15 05:41:51,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:51,369 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-15 05:41:51,369 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-15 05:41:51,370 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-15 05:41:51,370 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-15 05:41:51,370 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-15 05:41:51,370 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-15 05:41:51,371 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-15 05:41:51,371 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-15 05:41:51,374 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-15 05:41:51,374 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-15 05:41:51,375 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-15 05:41:51,375 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-15 05:41:51,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-15 05:41:51,375 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-15 05:41:51,376 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-15 05:41:51,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-15 05:41:51,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-15 05:41:51,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-15 05:41:51,376 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-15 05:41:51,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:51,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-15 05:41:51,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-15 05:41:51,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-15 05:41:51,540 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-15 05:41:51,540 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-15 05:41:51,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-15 05:41:51,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {4026#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-15 05:41:51,541 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-15 05:41:51,542 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-15 05:41:51,542 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-15 05:41:51,542 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-15 05:41:51,542 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-15 05:41:51,543 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-15 05:41:51,543 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-15 05:41:51,543 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-15 05:41:51,544 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-15 05:41:51,544 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-15 05:41:51,544 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-15 05:41:51,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {4040#(< 1 main_~edgecount~0)} ~i~0 := 0; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-15 05:41:51,545 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-15 05:41:51,545 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-15 05:41:51,546 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-15 05:41:51,546 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-15 05:41:51,547 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-15 05:41:51,548 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-15 05:41:51,548 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-15 05:41:51,548 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-15 05:41:51,548 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-15 05:41:51,549 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-15 05:41:51,549 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-15 05:41:51,549 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-15 05:41:51,550 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-15 05:41:51,550 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-15 05:41:51,550 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-15 05:41:51,550 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-15 05:41:51,552 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-15 05:41:51,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-15 05:41:51,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-15 05:41:51,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-15 05:41:51,553 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-15 05:41:51,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3874#true} is VALID [2022-04-15 05:41:51,553 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-15 05:41:51,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728960679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:51,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:51,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-04-15 05:41:51,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:51,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481137576] [2022-04-15 05:41:51,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481137576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:51,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:51,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:51,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672865478] [2022-04-15 05:41:51,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:51,554 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-15 05:41:51,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:51,555 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-15 05:41:51,585 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-15 05:41:51,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:41:51,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:51,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:41:51,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-15 05:41:51,586 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-15 05:41:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:51,858 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-15 05:41:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:41:51,858 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-15 05:41:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:51,858 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-15 05:41:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-15 05:41:51,859 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-15 05:41:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-15 05:41:51,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-15 05:41:51,919 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-15 05:41:51,920 INFO L225 Difference]: With dead ends: 73 [2022-04-15 05:41:51,920 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 05:41:51,920 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-15 05:41:51,921 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-15 05:41:51,921 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-15 05:41:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 05:41:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-04-15 05:41:51,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:51,970 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-15 05:41:51,970 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-15 05:41:51,971 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-15 05:41:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:51,972 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-15 05:41:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-15 05:41:51,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:51,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:51,972 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-15 05:41:51,973 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-15 05:41:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:51,978 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-15 05:41:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-15 05:41:51,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:51,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:51,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:51,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:51,978 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-15 05:41:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-04-15 05:41:51,979 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 41 [2022-04-15 05:41:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:51,979 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-04-15 05:41:51,979 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-15 05:41:51,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 56 transitions. [2022-04-15 05:41:52,047 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-15 05:41:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-04-15 05:41:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 05:41:52,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:52,048 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-15 05:41:52,065 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-15 05:41:52,256 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-15 05:41:52,257 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:52,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1307195270, now seen corresponding path program 9 times [2022-04-15 05:41:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:52,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [416030265] [2022-04-15 05:41:52,261 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:52,261 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:52,261 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:52,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1307195270, now seen corresponding path program 10 times [2022-04-15 05:41:52,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:52,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121448814] [2022-04-15 05:41:52,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:52,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:52,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:52,332 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-15 05:41:52,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-15 05:41:52,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-15 05:41:52,333 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-15 05:41:52,333 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-15 05:41:52,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-15 05:41:52,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-15 05:41:52,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-15 05:41:52,335 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-15 05:41:52,339 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-15 05:41:52,339 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-15 05:41:52,340 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-15 05:41:52,340 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-15 05:41:52,340 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-15 05:41:52,340 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-15 05:41:52,341 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-15 05:41:52,341 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-15 05:41:52,341 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-15 05:41:52,341 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-15 05:41:52,342 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-15 05:41:52,342 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-15 05:41:52,342 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-15 05:41:52,342 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-15 05:41:52,343 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-15 05:41:52,343 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-15 05:41:52,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {4490#(<= 20 main_~edgecount~0)} ~i~0 := 0; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:52,344 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-15 05:41:52,344 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-15 05:41:52,345 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-15 05:41:52,345 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-15 05:41:52,345 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-15 05:41:52,345 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-15 05:41:52,346 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-15 05:41:52,346 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-15 05:41:52,346 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-15 05:41:52,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {4486#false} assume !(~i~0 < ~nodecount~0); {4486#false} is VALID [2022-04-15 05:41:52,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-15 05:41:52,346 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-15 05:41:52,347 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-15 05:41:52,347 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-15 05:41:52,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {4486#false} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-15 05:41:52,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-15 05:41:52,347 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-15 05:41:52,347 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-15 05:41:52,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-15 05:41:52,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-15 05:41:52,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-15 05:41:52,347 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-15 05:41:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:52,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121448814] [2022-04-15 05:41:52,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121448814] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:52,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554586371] [2022-04-15 05:41:52,348 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:52,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:52,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:52,349 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-15 05:41:52,350 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-15 05:41:52,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:52,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:52,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:41:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:52,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:52,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4485#true} is VALID [2022-04-15 05:41:52,619 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-15 05:41:52,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-15 05:41:52,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-15 05:41:52,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-15 05:41:52,619 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-15 05:41:52,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,619 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-15 05:41:52,619 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-15 05:41:52,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,619 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-15 05:41:52,619 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-15 05:41:52,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,619 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-15 05:41:52,620 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-15 05:41:52,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,620 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-15 05:41:52,620 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-15 05:41:52,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,620 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-15 05:41:52,620 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-15 05:41:52,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {4485#true} assume !(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {4485#true} ~i~0 := 0; {4485#true} is VALID [2022-04-15 05:41:52,621 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-15 05:41:52,621 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-15 05:41:52,621 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-15 05:41:52,622 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-15 05:41:52,622 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-15 05:41:52,623 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-15 05:41:52,623 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-15 05:41:52,623 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-15 05:41:52,624 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-15 05:41:52,624 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-15 05:41:52,624 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-15 05:41:52,625 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-15 05:41:52,625 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-15 05:41:52,626 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-15 05:41:52,626 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-15 05:41:52,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-15 05:41:52,630 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-15 05:41:52,631 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-15 05:41:52,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-15 05:41:52,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-15 05:41:52,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-15 05:41:52,632 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-15 05:41:52,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:52,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-15 05:41:52,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-15 05:41:52,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-15 05:41:52,779 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-15 05:41:52,779 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-15 05:41:52,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-15 05:41:52,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {4650#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-15 05:41:52,784 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-15 05:41:52,786 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-15 05:41:52,786 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-15 05:41:52,786 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-15 05:41:52,787 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-15 05:41:52,787 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-15 05:41:52,787 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-15 05:41:52,788 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-15 05:41:52,788 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-15 05:41:52,789 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-15 05:41:52,789 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-15 05:41:52,789 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-15 05:41:52,790 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-15 05:41:52,790 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-15 05:41:52,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {4485#true} ~i~0 := 0; {4485#true} is VALID [2022-04-15 05:41:52,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {4485#true} assume !(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,790 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-15 05:41:52,790 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-15 05:41:52,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,790 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-15 05:41:52,790 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-15 05:41:52,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,791 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-15 05:41:52,791 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-15 05:41:52,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,791 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-15 05:41:52,791 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-15 05:41:52,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,791 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-15 05:41:52,791 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-15 05:41:52,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-15 05:41:52,791 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-15 05:41:52,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-15 05:41:52,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-15 05:41:52,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-15 05:41:52,791 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-15 05:41:52,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4485#true} is VALID [2022-04-15 05:41:52,792 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-15 05:41:52,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554586371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:52,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:52,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-04-15 05:41:52,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:52,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [416030265] [2022-04-15 05:41:52,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [416030265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:52,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:52,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:41:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821461151] [2022-04-15 05:41:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:52,793 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-15 05:41:52,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:52,793 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-15 05:41:52,817 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-15 05:41:52,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:41:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:52,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:41:52,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:41:52,818 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-15 05:41:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:53,103 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-15 05:41:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:41:53,104 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-15 05:41:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:53,104 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-15 05:41:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-15 05:41:53,105 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-15 05:41:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-15 05:41:53,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-15 05:41:53,164 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-15 05:41:53,165 INFO L225 Difference]: With dead ends: 79 [2022-04-15 05:41:53,165 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 05:41:53,166 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-15 05:41:53,166 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-15 05:41:53,167 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-15 05:41:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 05:41:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-15 05:41:53,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:53,216 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-15 05:41:53,216 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-15 05:41:53,216 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-15 05:41:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:53,217 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-15 05:41:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 05:41:53,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:53,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:53,217 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-15 05:41:53,218 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-15 05:41:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:53,218 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-15 05:41:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 05:41:53,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:53,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:53,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:53,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:53,219 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-15 05:41:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-15 05:41:53,219 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 44 [2022-04-15 05:41:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:53,220 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-15 05:41:53,220 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-15 05:41:53,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-15 05:41:53,284 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-15 05:41:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-15 05:41:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 05:41:53,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:53,285 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-15 05:41:53,302 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-15 05:41:53,495 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-15 05:41:53,496 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:53,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash -116869167, now seen corresponding path program 11 times [2022-04-15 05:41:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:53,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [645974921] [2022-04-15 05:41:53,502 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:53,502 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:53,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash -116869167, now seen corresponding path program 12 times [2022-04-15 05:41:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:53,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106057270] [2022-04-15 05:41:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:53,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:53,600 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-15 05:41:53,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-15 05:41:53,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-15 05:41:53,602 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-15 05:41:53,602 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-15 05:41:53,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-15 05:41:53,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-15 05:41:53,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-15 05:41:53,604 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-15 05:41:53,605 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-15 05:41:53,605 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-15 05:41:53,606 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-15 05:41:53,607 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-15 05:41:53,607 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-15 05:41:53,608 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-15 05:41:53,608 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-15 05:41:53,608 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-15 05:41:53,609 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-15 05:41:53,609 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-15 05:41:53,609 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-15 05:41:53,610 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-15 05:41:53,610 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-15 05:41:53,610 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-15 05:41:53,610 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-15 05:41:53,611 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-15 05:41:53,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {5148#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:53,611 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-15 05:41:53,612 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-15 05:41:53,612 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-15 05:41:53,613 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-15 05:41:53,613 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-15 05:41:53,613 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-15 05:41:53,614 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-15 05:41:53,614 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-15 05:41:53,614 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-15 05:41:53,615 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-15 05:41:53,615 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-15 05:41:53,615 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-15 05:41:53,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {5144#false} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-15 05:41:53,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-15 05:41:53,615 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-15 05:41:53,616 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-15 05:41:53,616 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-15 05:41:53,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-15 05:41:53,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-15 05:41:53,616 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-15 05:41:53,616 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-15 05:41:53,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-15 05:41:53,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-15 05:41:53,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-15 05:41:53,616 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-15 05:41:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:53,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106057270] [2022-04-15 05:41:53,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106057270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:53,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110489394] [2022-04-15 05:41:53,617 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:41:53,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:53,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:53,618 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-15 05:41:53,619 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-15 05:41:53,719 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:41:53,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:53,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:41:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:53,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:53,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2022-04-15 05:41:53,937 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-15 05:41:53,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-15 05:41:53,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-15 05:41:53,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-15 05:41:53,940 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-15 05:41:53,940 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-15 05:41:53,940 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-15 05:41:53,941 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-15 05:41:53,941 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-15 05:41:53,941 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-15 05:41:53,941 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-15 05:41:53,942 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-15 05:41:53,942 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-15 05:41:53,942 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-15 05:41:53,943 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-15 05:41:53,943 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-15 05:41:53,943 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-15 05:41:53,944 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-15 05:41:53,944 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-15 05:41:53,944 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-15 05:41:53,944 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-15 05:41:53,945 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-15 05:41:53,945 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-15 05:41:53,946 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-15 05:41:53,946 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-15 05:41:53,946 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-15 05:41:53,947 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-15 05:41:53,947 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-15 05:41:53,948 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-15 05:41:53,948 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-15 05:41:53,953 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-15 05:41:53,953 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-15 05:41:53,954 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-15 05:41:53,954 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-15 05:41:53,955 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-15 05:41:53,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-15 05:41:53,955 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-15 05:41:53,955 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-15 05:41:53,955 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-15 05:41:53,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-15 05:41:53,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-15 05:41:53,955 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-15 05:41:53,956 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-15 05:41:53,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-15 05:41:53,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-15 05:41:53,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-15 05:41:53,956 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-15 05:41:53,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:54,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-15 05:41:54,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-15 05:41:54,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-15 05:41:54,139 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-15 05:41:54,139 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-15 05:41:54,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-15 05:41:54,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-15 05:41:54,139 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-15 05:41:54,139 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-15 05:41:54,139 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-15 05:41:54,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-15 05:41:54,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {5331#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-15 05:41:54,140 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-15 05:41:54,141 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-15 05:41:54,141 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-15 05:41:54,141 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-15 05:41:54,141 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-15 05:41:54,142 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-15 05:41:54,142 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-15 05:41:54,142 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-15 05:41:54,143 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-15 05:41:54,143 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-15 05:41:54,143 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-15 05:41:54,144 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-15 05:41:54,144 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-15 05:41:54,144 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-15 05:41:54,145 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-15 05:41:54,145 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-15 05:41:54,145 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-15 05:41:54,145 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-15 05:41:54,146 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-15 05:41:54,146 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-15 05:41:54,146 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-15 05:41:54,147 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-15 05:41:54,147 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-15 05:41:54,147 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-15 05:41:54,148 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-15 05:41:54,148 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-15 05:41:54,148 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-15 05:41:54,148 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-15 05:41:54,149 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-15 05:41:54,151 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-15 05:41:54,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-15 05:41:54,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-15 05:41:54,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-15 05:41:54,151 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-15 05:41:54,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2022-04-15 05:41:54,151 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-15 05:41:54,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110489394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:54,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:54,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-04-15 05:41:54,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:54,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [645974921] [2022-04-15 05:41:54,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [645974921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:54,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:54,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:41:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275473297] [2022-04-15 05:41:54,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:54,153 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-15 05:41:54,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:54,153 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-15 05:41:54,179 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-15 05:41:54,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:41:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:54,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:41:54,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:41:54,180 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-15 05:41:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:54,545 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-04-15 05:41:54,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:41:54,545 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-15 05:41:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:54,545 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-15 05:41:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-15 05:41:54,546 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-15 05:41:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-15 05:41:54,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-04-15 05:41:54,633 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-15 05:41:54,634 INFO L225 Difference]: With dead ends: 85 [2022-04-15 05:41:54,634 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 05:41:54,634 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-15 05:41:54,635 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-15 05:41:54,635 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-15 05:41:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 05:41:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-15 05:41:54,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:54,694 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-15 05:41:54,694 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-15 05:41:54,694 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-15 05:41:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:54,695 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-15 05:41:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-15 05:41:54,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:54,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:54,696 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-15 05:41:54,696 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-15 05:41:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:54,697 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-15 05:41:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-15 05:41:54,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:54,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:54,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:54,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:54,698 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-15 05:41:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-04-15 05:41:54,699 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 47 [2022-04-15 05:41:54,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:54,699 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-04-15 05:41:54,699 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-15 05:41:54,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 64 transitions. [2022-04-15 05:41:54,772 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-15 05:41:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-04-15 05:41:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 05:41:54,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:54,773 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-15 05:41:54,790 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-15 05:41:54,976 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-15 05:41:54,976 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:54,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1638069530, now seen corresponding path program 13 times [2022-04-15 05:41:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:54,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [471557948] [2022-04-15 05:41:54,980 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:54,980 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:54,980 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1638069530, now seen corresponding path program 14 times [2022-04-15 05:41:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:54,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24942192] [2022-04-15 05:41:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,060 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-15 05:41:55,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-15 05:41:55,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-15 05:41:55,061 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-15 05:41:55,061 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-15 05:41:55,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-15 05:41:55,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-15 05:41:55,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-15 05:41:55,063 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-15 05:41:55,063 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-15 05:41:55,063 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-15 05:41:55,064 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-15 05:41:55,064 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-15 05:41:55,064 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-15 05:41:55,064 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-15 05:41:55,065 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-15 05:41:55,065 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-15 05:41:55,065 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-15 05:41:55,065 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-15 05:41:55,066 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-15 05:41:55,066 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-15 05:41:55,066 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-15 05:41:55,066 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-15 05:41:55,067 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-15 05:41:55,067 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-15 05:41:55,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {5850#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:55,068 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-15 05:41:55,068 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-15 05:41:55,069 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-15 05:41:55,069 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-15 05:41:55,070 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-15 05:41:55,070 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-15 05:41:55,071 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-15 05:41:55,071 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-15 05:41:55,071 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-15 05:41:55,072 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-15 05:41:55,072 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-15 05:41:55,072 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-15 05:41:55,073 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-15 05:41:55,073 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-15 05:41:55,073 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-15 05:41:55,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-15 05:41:55,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-15 05:41:55,073 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-15 05:41:55,074 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-15 05:41:55,074 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-15 05:41:55,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-15 05:41:55,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-15 05:41:55,074 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-15 05:41:55,074 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-15 05:41:55,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-15 05:41:55,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-15 05:41:55,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-15 05:41:55,075 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-15 05:41:55,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:55,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24942192] [2022-04-15 05:41:55,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24942192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:55,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70247929] [2022-04-15 05:41:55,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:55,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:55,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:55,092 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-15 05:41:55,104 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-15 05:41:55,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:55,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:55,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:41:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:55,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-15 05:41:55,498 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-15 05:41:55,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-15 05:41:55,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-15 05:41:55,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-15 05:41:55,500 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-15 05:41:55,501 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-15 05:41:55,501 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-15 05:41:55,501 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-15 05:41:55,501 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-15 05:41:55,502 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-15 05:41:55,502 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-15 05:41:55,502 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-15 05:41:55,503 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-15 05:41:55,503 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-15 05:41:55,503 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-15 05:41:55,504 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-15 05:41:55,504 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-15 05:41:55,504 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-15 05:41:55,504 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-15 05:41:55,505 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-15 05:41:55,505 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-15 05:41:55,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {5850#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:55,506 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-15 05:41:55,506 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-15 05:41:55,507 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-15 05:41:55,507 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-15 05:41:55,508 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-15 05:41:55,508 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-15 05:41:55,508 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-15 05:41:55,509 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-15 05:41:55,509 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-15 05:41:55,510 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-15 05:41:55,510 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-15 05:41:55,511 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-15 05:41:55,511 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-15 05:41:55,512 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-15 05:41:55,512 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-15 05:41:55,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-15 05:41:55,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-15 05:41:55,512 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-15 05:41:55,512 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-15 05:41:55,512 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-15 05:41:55,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-15 05:41:55,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-15 05:41:55,512 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-15 05:41:55,512 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-15 05:41:55,513 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-15 05:41:55,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-15 05:41:55,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-15 05:41:55,513 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-15 05:41:55,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:55,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-15 05:41:55,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-15 05:41:55,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-15 05:41:55,735 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-15 05:41:55,735 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-15 05:41:55,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-15 05:41:55,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-15 05:41:55,736 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-15 05:41:55,736 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-15 05:41:55,736 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-15 05:41:55,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-15 05:41:55,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-15 05:41:55,736 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-15 05:41:55,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {6051#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5846#false} is VALID [2022-04-15 05:41:55,737 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-15 05:41:55,737 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-15 05:41:55,738 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-15 05:41:55,738 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-15 05:41:55,739 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-15 05:41:55,739 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-15 05:41:55,739 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-15 05:41:55,740 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-15 05:41:55,740 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-15 05:41:55,741 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-15 05:41:55,741 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-15 05:41:55,741 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-15 05:41:55,742 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-15 05:41:55,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {6095#(< 4 main_~edgecount~0)} ~i~0 := 0; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-15 05:41:55,742 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-15 05:41:55,743 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-15 05:41:55,743 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-15 05:41:55,743 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-15 05:41:55,744 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-15 05:41:55,744 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-15 05:41:55,744 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-15 05:41:55,744 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-15 05:41:55,745 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-15 05:41:55,745 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-15 05:41:55,746 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-15 05:41:55,746 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-15 05:41:55,746 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-15 05:41:55,747 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-15 05:41:55,747 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-15 05:41:55,747 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-15 05:41:55,749 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-15 05:41:55,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-15 05:41:55,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-15 05:41:55,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-15 05:41:55,750 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-15 05:41:55,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-15 05:41:55,750 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-15 05:41:55,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70247929] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:55,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:55,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-04-15 05:41:55,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:55,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [471557948] [2022-04-15 05:41:55,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [471557948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:55,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:55,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:41:55,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903175941] [2022-04-15 05:41:55,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:55,751 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-15 05:41:55,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:55,751 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-15 05:41:55,782 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-15 05:41:55,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:41:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:55,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:41:55,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:41:55,783 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-15 05:41:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,081 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-15 05:41:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:41:56,081 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-15 05:41:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:56,082 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-15 05:41:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-15 05:41:56,082 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-15 05:41:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-15 05:41:56,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2022-04-15 05:41:56,150 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-15 05:41:56,151 INFO L225 Difference]: With dead ends: 91 [2022-04-15 05:41:56,151 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 05:41:56,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:41:56,152 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-15 05:41:56,152 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-15 05:41:56,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 05:41:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-04-15 05:41:56,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:56,203 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-15 05:41:56,203 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-15 05:41:56,203 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-15 05:41:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,205 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 05:41:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 05:41:56,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:56,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:56,205 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-15 05:41:56,205 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-15 05:41:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,206 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 05:41:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 05:41:56,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:56,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:56,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:56,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:56,207 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-15 05:41:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-04-15 05:41:56,208 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 50 [2022-04-15 05:41:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:56,208 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-04-15 05:41:56,208 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-15 05:41:56,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 68 transitions. [2022-04-15 05:41:56,282 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-15 05:41:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-04-15 05:41:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 05:41:56,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:56,283 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-15 05:41:56,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 05:41:56,487 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-15 05:41:56,488 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash 379897649, now seen corresponding path program 15 times [2022-04-15 05:41:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:56,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [811121025] [2022-04-15 05:41:56,491 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:56,491 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:56,491 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:56,491 INFO L85 PathProgramCache]: Analyzing trace with hash 379897649, now seen corresponding path program 16 times [2022-04-15 05:41:56,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:56,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845507502] [2022-04-15 05:41:56,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,614 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-15 05:41:56,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-15 05:41:56,614 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-15 05:41:56,615 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-15 05:41:56,615 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-15 05:41:56,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-15 05:41:56,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-15 05:41:56,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-15 05:41:56,617 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-15 05:41:56,617 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-15 05:41:56,618 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-15 05:41:56,618 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-15 05:41:56,618 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-15 05:41:56,618 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-15 05:41:56,619 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-15 05:41:56,619 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-15 05:41:56,619 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-15 05:41:56,619 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-15 05:41:56,620 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-15 05:41:56,620 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-15 05:41:56,620 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-15 05:41:56,620 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-15 05:41:56,621 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-15 05:41:56,621 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-15 05:41:56,621 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-15 05:41:56,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {6602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:56,622 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-15 05:41:56,622 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-15 05:41:56,623 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-15 05:41:56,623 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-15 05:41:56,623 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-15 05:41:56,624 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-15 05:41:56,624 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-15 05:41:56,624 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-15 05:41:56,624 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-15 05:41:56,625 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-15 05:41:56,625 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-15 05:41:56,625 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-15 05:41:56,626 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-15 05:41:56,626 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-15 05:41:56,627 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-15 05:41:56,627 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-15 05:41:56,627 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-15 05:41:56,627 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-15 05:41:56,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {6598#false} assume !(~i~0 < ~nodecount~0); {6598#false} is VALID [2022-04-15 05:41:56,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-15 05:41:56,628 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-15 05:41:56,628 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-15 05:41:56,628 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-15 05:41:56,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {6598#false} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-15 05:41:56,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-15 05:41:56,628 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-15 05:41:56,628 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-15 05:41:56,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-15 05:41:56,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-15 05:41:56,628 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-15 05:41:56,628 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-15 05:41:56,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:56,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845507502] [2022-04-15 05:41:56,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845507502] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:56,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526708751] [2022-04-15 05:41:56,629 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:56,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:56,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:56,630 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-15 05:41:56,631 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-15 05:41:56,727 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:56,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:56,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 05:41:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:57,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6597#true} is VALID [2022-04-15 05:41:57,000 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-15 05:41:57,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-15 05:41:57,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-15 05:41:57,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-15 05:41:57,001 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-15 05:41:57,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,001 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-15 05:41:57,001 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-15 05:41:57,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,001 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-15 05:41:57,001 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-15 05:41:57,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,001 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-15 05:41:57,001 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-15 05:41:57,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,001 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-15 05:41:57,002 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-15 05:41:57,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,002 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-15 05:41:57,002 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-15 05:41:57,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {6597#true} assume !(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {6597#true} ~i~0 := 0; {6597#true} is VALID [2022-04-15 05:41:57,003 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-15 05:41:57,003 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-15 05:41:57,003 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-15 05:41:57,003 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-15 05:41:57,004 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-15 05:41:57,004 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-15 05:41:57,004 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-15 05:41:57,005 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-15 05:41:57,005 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-15 05:41:57,005 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-15 05:41:57,006 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-15 05:41:57,006 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-15 05:41:57,006 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-15 05:41:57,007 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-15 05:41:57,007 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-15 05:41:57,007 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-15 05:41:57,008 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-15 05:41:57,008 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-15 05:41:57,008 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-15 05:41:57,008 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-15 05:41:57,009 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-15 05:41:57,009 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-15 05:41:57,010 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-15 05:41:57,010 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-15 05:41:57,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-15 05:41:57,010 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-15 05:41:57,010 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-15 05:41:57,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-15 05:41:57,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-15 05:41:57,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-15 05:41:57,011 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-15 05:41:57,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:57,226 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-15 05:41:57,226 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-15 05:41:57,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-15 05:41:57,226 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-15 05:41:57,226 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-15 05:41:57,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-15 05:41:57,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {6795#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-15 05:41:57,227 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-15 05:41:57,228 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-15 05:41:57,228 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-15 05:41:57,228 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-15 05:41:57,228 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-15 05:41:57,229 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-15 05:41:57,229 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-15 05:41:57,229 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-15 05:41:57,230 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-15 05:41:57,230 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-15 05:41:57,230 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-15 05:41:57,231 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-15 05:41:57,231 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-15 05:41:57,231 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-15 05:41:57,232 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-15 05:41:57,232 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-15 05:41:57,232 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-15 05:41:57,233 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-15 05:41:57,233 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-15 05:41:57,233 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-15 05:41:57,234 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-15 05:41:57,234 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-15 05:41:57,235 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-15 05:41:57,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {6597#true} ~i~0 := 0; {6597#true} is VALID [2022-04-15 05:41:57,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {6597#true} assume !(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,235 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-15 05:41:57,235 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-15 05:41:57,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,235 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-15 05:41:57,235 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-15 05:41:57,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,235 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-15 05:41:57,235 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-15 05:41:57,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,235 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-15 05:41:57,236 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-15 05:41:57,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,236 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-15 05:41:57,236 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-15 05:41:57,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-15 05:41:57,236 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-15 05:41:57,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-15 05:41:57,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-15 05:41:57,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-15 05:41:57,236 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-15 05:41:57,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6597#true} is VALID [2022-04-15 05:41:57,237 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-15 05:41:57,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526708751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:57,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:57,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-04-15 05:41:57,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:57,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [811121025] [2022-04-15 05:41:57,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [811121025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:57,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:57,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:41:57,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489384746] [2022-04-15 05:41:57,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:57,238 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-15 05:41:57,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:57,238 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-15 05:41:57,265 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-15 05:41:57,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:41:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:41:57,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:41:57,266 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-15 05:41:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,649 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2022-04-15 05:41:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:41:57,649 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-15 05:41:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:57,649 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-15 05:41:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-15 05:41:57,650 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-15 05:41:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-15 05:41:57,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-15 05:41:57,716 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-15 05:41:57,716 INFO L225 Difference]: With dead ends: 97 [2022-04-15 05:41:57,716 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 05:41:57,717 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-15 05:41:57,717 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-15 05:41:57,717 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-15 05:41:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 05:41:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-04-15 05:41:57,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:57,789 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-15 05:41:57,789 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-15 05:41:57,789 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-15 05:41:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,790 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 05:41:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-15 05:41:57,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:57,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:57,791 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-15 05:41:57,791 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-15 05:41:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,791 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 05:41:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-15 05:41:57,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:57,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:57,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:57,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:57,792 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-15 05:41:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-04-15 05:41:57,793 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 53 [2022-04-15 05:41:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:57,793 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-04-15 05:41:57,793 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-15 05:41:57,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 72 transitions. [2022-04-15 05:41:57,887 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-15 05:41:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-04-15 05:41:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 05:41:57,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:57,887 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-15 05:41:57,903 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-15 05:41:58,087 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-15 05:41:58,088 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:58,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 360982970, now seen corresponding path program 17 times [2022-04-15 05:41:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:58,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921214012] [2022-04-15 05:41:58,091 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:58,091 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:58,091 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash 360982970, now seen corresponding path program 18 times [2022-04-15 05:41:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:58,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35581162] [2022-04-15 05:41:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,185 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-15 05:41:58,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-15 05:41:58,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-15 05:41:58,186 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-15 05:41:58,186 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-15 05:41:58,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-15 05:41:58,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-15 05:41:58,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-15 05:41:58,188 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-15 05:41:58,188 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-15 05:41:58,189 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-15 05:41:58,189 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-15 05:41:58,189 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-15 05:41:58,189 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-15 05:41:58,190 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-15 05:41:58,190 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-15 05:41:58,190 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-15 05:41:58,190 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-15 05:41:58,191 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-15 05:41:58,191 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-15 05:41:58,191 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-15 05:41:58,191 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-15 05:41:58,191 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-15 05:41:58,192 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-15 05:41:58,192 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-15 05:41:58,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:58,193 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-15 05:41:58,193 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-15 05:41:58,193 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-15 05:41:58,194 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-15 05:41:58,194 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-15 05:41:58,194 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-15 05:41:58,195 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-15 05:41:58,195 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-15 05:41:58,195 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-15 05:41:58,195 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-15 05:41:58,196 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-15 05:41:58,196 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-15 05:41:58,196 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-15 05:41:58,197 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-15 05:41:58,197 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-15 05:41:58,197 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-15 05:41:58,198 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-15 05:41:58,198 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-15 05:41:58,199 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-15 05:41:58,199 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-15 05:41:58,199 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-15 05:41:58,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {7398#false} assume !(~i~0 < ~nodecount~0); {7398#false} is VALID [2022-04-15 05:41:58,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-15 05:41:58,199 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-15 05:41:58,199 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-15 05:41:58,199 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-15 05:41:58,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {7398#false} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-15 05:41:58,199 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-15 05:41:58,200 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-15 05:41:58,200 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-15 05:41:58,200 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-15 05:41:58,200 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-15 05:41:58,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-15 05:41:58,200 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-15 05:41:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:58,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35581162] [2022-04-15 05:41:58,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35581162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:58,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791842251] [2022-04-15 05:41:58,200 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:41:58,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:58,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:58,201 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-15 05:41:58,203 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-15 05:41:58,310 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:41:58,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:58,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:41:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:58,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-15 05:41:58,518 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-15 05:41:58,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-15 05:41:58,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-15 05:41:58,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-15 05:41:58,522 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-15 05:41:58,523 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-15 05:41:58,523 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-15 05:41:58,523 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-15 05:41:58,523 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-15 05:41:58,524 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-15 05:41:58,524 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-15 05:41:58,524 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-15 05:41:58,524 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-15 05:41:58,525 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-15 05:41:58,525 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-15 05:41:58,525 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-15 05:41:58,526 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-15 05:41:58,526 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-15 05:41:58,526 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-15 05:41:58,526 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-15 05:41:58,527 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-15 05:41:58,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:58,527 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-15 05:41:58,528 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-15 05:41:58,528 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-15 05:41:58,528 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-15 05:41:58,528 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-15 05:41:58,529 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-15 05:41:58,529 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-15 05:41:58,529 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-15 05:41:58,530 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-15 05:41:58,530 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-15 05:41:58,530 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-15 05:41:58,530 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-15 05:41:58,531 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-15 05:41:58,531 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-15 05:41:58,531 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-15 05:41:58,531 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-15 05:41:58,532 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-15 05:41:58,532 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-15 05:41:58,532 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-15 05:41:58,533 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-15 05:41:58,533 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-15 05:41:58,533 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-15 05:41:58,534 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-15 05:41:58,534 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-15 05:41:58,534 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-15 05:41:58,535 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-15 05:41:58,536 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-15 05:41:58,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-15 05:41:58,536 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-15 05:41:58,536 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-15 05:41:58,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-15 05:41:58,536 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-15 05:41:58,536 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-15 05:41:58,536 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-15 05:41:58,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:58,722 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-15 05:41:58,722 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-15 05:41:58,722 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-15 05:41:58,722 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-15 05:41:58,722 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-15 05:41:58,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-15 05:41:58,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {7599#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-15 05:41:58,723 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-15 05:41:58,723 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-15 05:41:58,723 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-15 05:41:58,724 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-15 05:41:58,724 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-15 05:41:58,734 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-15 05:41:58,734 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-15 05:41:58,734 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-15 05:41:58,735 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-15 05:41:58,735 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-15 05:41:58,735 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-15 05:41:58,736 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-15 05:41:58,736 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-15 05:41:58,736 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-15 05:41:58,737 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-15 05:41:58,737 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-15 05:41:58,737 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-15 05:41:58,738 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-15 05:41:58,738 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-15 05:41:58,738 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-15 05:41:58,738 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-15 05:41:58,739 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-15 05:41:58,739 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-15 05:41:58,739 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-15 05:41:58,740 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-15 05:41:58,740 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-15 05:41:58,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {7613#(< 1 main_~edgecount~0)} ~i~0 := 0; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-15 05:41:58,740 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-15 05:41:58,741 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-15 05:41:58,741 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-15 05:41:58,741 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-15 05:41:58,742 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-15 05:41:58,742 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-15 05:41:58,742 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-15 05:41:58,743 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-15 05:41:58,743 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-15 05:41:58,743 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-15 05:41:58,743 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-15 05:41:58,744 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-15 05:41:58,744 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-15 05:41:58,744 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-15 05:41:58,745 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-15 05:41:58,745 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-15 05:41:58,747 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-15 05:41:58,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-15 05:41:58,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-15 05:41:58,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-15 05:41:58,747 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-15 05:41:58,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-15 05:41:58,747 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-15 05:41:58,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791842251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:58,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:58,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2022-04-15 05:41:58,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:58,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921214012] [2022-04-15 05:41:58,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921214012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:58,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:58,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:41:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447883999] [2022-04-15 05:41:58,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:58,749 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-15 05:41:58,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:58,749 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-15 05:41:58,781 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-15 05:41:58,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:41:58,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:58,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:41:58,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:41:58,782 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-15 05:41:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:59,299 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-15 05:41:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:41:59,300 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-15 05:41:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:59,300 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-15 05:41:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-04-15 05:41:59,301 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-15 05:41:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-04-15 05:41:59,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 89 transitions. [2022-04-15 05:41:59,373 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-15 05:41:59,374 INFO L225 Difference]: With dead ends: 103 [2022-04-15 05:41:59,375 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 05:41:59,375 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-15 05:41:59,379 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-15 05:41:59,379 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-15 05:41:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 05:41:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-15 05:41:59,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:59,445 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-15 05:41:59,446 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-15 05:41:59,446 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-15 05:41:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:59,447 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-15 05:41:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 05:41:59,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:59,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:59,447 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-15 05:41:59,447 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-15 05:41:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:59,448 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-15 05:41:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 05:41:59,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:59,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:59,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:59,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:59,449 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-15 05:41:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-04-15 05:41:59,449 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 56 [2022-04-15 05:41:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:59,450 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-04-15 05:41:59,450 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-15 05:41:59,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 76 transitions. [2022-04-15 05:41:59,544 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-15 05:41:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-04-15 05:41:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 05:41:59,545 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:59,546 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-15 05:41:59,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 05:41:59,747 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-15 05:41:59,747 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:59,748 INFO L85 PathProgramCache]: Analyzing trace with hash -485503343, now seen corresponding path program 19 times [2022-04-15 05:41:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:59,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2133847222] [2022-04-15 05:41:59,751 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:59,751 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:59,751 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash -485503343, now seen corresponding path program 20 times [2022-04-15 05:41:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:59,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977416385] [2022-04-15 05:41:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:59,903 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-15 05:41:59,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-15 05:41:59,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-15 05:41:59,904 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-15 05:41:59,904 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-15 05:41:59,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-15 05:41:59,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-15 05:41:59,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-15 05:41:59,906 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-15 05:41:59,907 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-15 05:41:59,907 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-15 05:41:59,907 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-15 05:41:59,907 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-15 05:41:59,908 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-15 05:41:59,908 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-15 05:41:59,908 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-15 05:41:59,909 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-15 05:41:59,909 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-15 05:41:59,909 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-15 05:41:59,909 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-15 05:41:59,910 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-15 05:41:59,910 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-15 05:41:59,910 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-15 05:41:59,911 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-15 05:41:59,911 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-15 05:41:59,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {8238#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:41:59,912 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-15 05:41:59,912 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-15 05:41:59,913 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-15 05:41:59,913 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-15 05:41:59,913 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-15 05:41:59,914 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-15 05:41:59,914 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-15 05:41:59,914 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-15 05:41:59,915 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-15 05:41:59,915 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-15 05:41:59,915 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-15 05:41:59,916 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-15 05:41:59,916 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-15 05:41:59,917 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-15 05:41:59,917 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-15 05:41:59,917 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-15 05:41:59,918 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-15 05:41:59,918 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-15 05:41:59,919 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-15 05:41:59,919 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-15 05:41:59,919 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-15 05:41:59,920 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-15 05:41:59,920 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-15 05:41:59,920 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-15 05:41:59,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-15 05:41:59,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-15 05:41:59,921 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-15 05:41:59,921 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-15 05:41:59,921 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-15 05:41:59,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-15 05:41:59,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-15 05:41:59,921 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-15 05:41:59,921 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-15 05:41:59,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-15 05:41:59,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-15 05:41:59,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-15 05:41:59,921 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-15 05:41:59,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:59,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977416385] [2022-04-15 05:41:59,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977416385] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:59,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452051190] [2022-04-15 05:41:59,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:59,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:59,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:59,923 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-15 05:41:59,924 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-15 05:42:00,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:00,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:00,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 05:42:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:00,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:00,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8233#true} is VALID [2022-04-15 05:42:00,436 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-15 05:42:00,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-15 05:42:00,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-15 05:42:00,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-15 05:42:00,439 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-15 05:42:00,439 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-15 05:42:00,440 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-15 05:42:00,440 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-15 05:42:00,440 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-15 05:42:00,440 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-15 05:42:00,441 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-15 05:42:00,441 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-15 05:42:00,441 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-15 05:42:00,442 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-15 05:42:00,442 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-15 05:42:00,442 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-15 05:42:00,442 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-15 05:42:00,443 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-15 05:42:00,443 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-15 05:42:00,443 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-15 05:42:00,444 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-15 05:42:00,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {8238#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:00,444 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-15 05:42:00,445 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-15 05:42:00,445 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-15 05:42:00,446 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-15 05:42:00,446 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-15 05:42:00,447 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-15 05:42:00,447 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-15 05:42:00,448 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-15 05:42:00,448 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-15 05:42:00,449 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-15 05:42:00,449 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-15 05:42:00,449 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-15 05:42:00,450 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-15 05:42:00,450 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-15 05:42:00,451 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-15 05:42:00,451 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-15 05:42:00,452 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-15 05:42:00,452 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-15 05:42:00,453 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-15 05:42:00,453 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-15 05:42:00,454 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-15 05:42:00,454 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-15 05:42:00,455 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-15 05:42:00,455 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-15 05:42:00,455 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-15 05:42:00,455 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-15 05:42:00,455 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-15 05:42:00,455 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-15 05:42:00,455 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-15 05:42:00,455 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-15 05:42:00,455 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-15 05:42:00,455 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-15 05:42:00,455 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-15 05:42:00,455 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-15 05:42:00,455 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-15 05:42:00,455 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-15 05:42:00,456 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-15 05:42:00,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:00,781 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-15 05:42:00,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-15 05:42:00,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-15 05:42:00,781 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-15 05:42:00,782 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-15 05:42:00,782 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-15 05:42:00,782 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-15 05:42:00,782 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-15 05:42:00,782 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-15 05:42:00,782 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-15 05:42:00,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-15 05:42:00,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-15 05:42:00,782 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-15 05:42:00,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {8472#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8234#false} is VALID [2022-04-15 05:42:00,783 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-15 05:42:00,783 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-15 05:42:00,784 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-15 05:42:00,784 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-15 05:42:00,784 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-15 05:42:00,785 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-15 05:42:00,785 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-15 05:42:00,786 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-15 05:42:00,786 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-15 05:42:00,787 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-15 05:42:00,787 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-15 05:42:00,787 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-15 05:42:00,788 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-15 05:42:00,788 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-15 05:42:00,788 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-15 05:42:00,789 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-15 05:42:00,789 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-15 05:42:00,790 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-15 05:42:00,790 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-15 05:42:00,790 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-15 05:42:00,791 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-15 05:42:00,791 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-15 05:42:00,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {8546#(< 7 main_~edgecount~0)} ~i~0 := 0; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-15 05:42:00,791 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-15 05:42:00,792 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-15 05:42:00,792 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-15 05:42:00,792 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-15 05:42:00,793 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-15 05:42:00,793 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-15 05:42:00,793 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-15 05:42:00,793 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-15 05:42:00,794 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-15 05:42:00,794 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-15 05:42:00,794 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-15 05:42:00,795 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-15 05:42:00,795 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-15 05:42:00,795 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-15 05:42:00,795 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-15 05:42:00,796 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-15 05:42:00,798 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-15 05:42:00,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-15 05:42:00,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-15 05:42:00,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-15 05:42:00,798 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-15 05:42:00,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8233#true} is VALID [2022-04-15 05:42:00,798 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-15 05:42:00,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452051190] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:00,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:00,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-04-15 05:42:00,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:00,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2133847222] [2022-04-15 05:42:00,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2133847222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:00,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:00,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 05:42:00,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997242789] [2022-04-15 05:42:00,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:00,800 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-15 05:42:00,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:00,800 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-15 05:42:00,835 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-15 05:42:00,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 05:42:00,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:00,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 05:42:00,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=483, Unknown=0, NotChecked=0, Total=812 [2022-04-15 05:42:00,836 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-15 05:42:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:01,318 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2022-04-15 05:42:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:42:01,318 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-15 05:42:01,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:01,318 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-15 05:42:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-15 05:42:01,319 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-15 05:42:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-15 05:42:01,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 93 transitions. [2022-04-15 05:42:01,396 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-15 05:42:01,397 INFO L225 Difference]: With dead ends: 109 [2022-04-15 05:42:01,398 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 05:42:01,398 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-15 05:42:01,399 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-15 05:42:01,399 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-15 05:42:01,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 05:42:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-15 05:42:01,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:01,474 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-15 05:42:01,474 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-15 05:42:01,474 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-15 05:42:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:01,476 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-15 05:42:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-04-15 05:42:01,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:01,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:01,476 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-15 05:42:01,476 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-15 05:42:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:01,477 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-15 05:42:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-04-15 05:42:01,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:01,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:01,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:01,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:01,478 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-15 05:42:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-04-15 05:42:01,478 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 59 [2022-04-15 05:42:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:01,479 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-04-15 05:42:01,479 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-15 05:42:01,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 80 transitions. [2022-04-15 05:42:01,578 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-15 05:42:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-15 05:42:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 05:42:01,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:01,579 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-15 05:42:01,603 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-15 05:42:01,783 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-15 05:42:01,783 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:01,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1888708186, now seen corresponding path program 21 times [2022-04-15 05:42:01,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:01,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [206948186] [2022-04-15 05:42:01,787 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:01,787 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:01,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1888708186, now seen corresponding path program 22 times [2022-04-15 05:42:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:01,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100362007] [2022-04-15 05:42:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,927 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-15 05:42:01,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 05:42:01,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-15 05:42:01,928 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-15 05:42:01,928 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-15 05:42:01,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 05:42:01,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-15 05:42:01,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-15 05:42:01,930 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-15 05:42:01,931 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-15 05:42:01,931 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-15 05:42:01,931 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-15 05:42:01,932 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-15 05:42:01,932 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-15 05:42:01,932 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-15 05:42:01,932 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-15 05:42:01,933 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-15 05:42:01,933 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-15 05:42:01,933 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-15 05:42:01,933 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-15 05:42:01,934 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-15 05:42:01,935 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-15 05:42:01,935 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-15 05:42:01,936 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-15 05:42:01,936 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-15 05:42:01,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {9131#(<= 20 main_~edgecount~0)} ~i~0 := 0; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:01,937 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-15 05:42:01,937 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-15 05:42:01,938 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-15 05:42:01,938 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-15 05:42:01,939 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-15 05:42:01,939 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-15 05:42:01,939 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-15 05:42:01,940 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-15 05:42:01,940 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-15 05:42:01,940 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-15 05:42:01,941 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-15 05:42:01,941 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-15 05:42:01,941 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-15 05:42:01,942 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-15 05:42:01,942 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-15 05:42:01,943 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-15 05:42:01,943 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-15 05:42:01,944 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-15 05:42:01,944 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-15 05:42:01,945 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-15 05:42:01,945 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-15 05:42:01,946 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-15 05:42:01,946 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-15 05:42:01,946 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-15 05:42:01,947 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-15 05:42:01,947 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-15 05:42:01,947 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-15 05:42:01,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {9127#false} assume !(~i~0 < ~nodecount~0); {9127#false} is VALID [2022-04-15 05:42:01,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-15 05:42:01,947 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-15 05:42:01,947 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-15 05:42:01,947 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-15 05:42:01,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {9127#false} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-15 05:42:01,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-15 05:42:01,948 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-15 05:42:01,948 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-15 05:42:01,948 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-15 05:42:01,948 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-15 05:42:01,948 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-15 05:42:01,948 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-15 05:42:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:01,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100362007] [2022-04-15 05:42:01,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100362007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:01,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340737534] [2022-04-15 05:42:01,949 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:01,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:01,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:01,950 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-15 05:42:01,951 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-15 05:42:02,048 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:02,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:02,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:42:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:02,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:02,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2022-04-15 05:42:02,394 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-15 05:42:02,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 05:42:02,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-15 05:42:02,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-15 05:42:02,394 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-15 05:42:02,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,394 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-15 05:42:02,394 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-15 05:42:02,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,395 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-15 05:42:02,395 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-15 05:42:02,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,395 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-15 05:42:02,395 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-15 05:42:02,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,395 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-15 05:42:02,395 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-15 05:42:02,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,395 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-15 05:42:02,395 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-15 05:42:02,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#true} assume !(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {9126#true} ~i~0 := 0; {9126#true} is VALID [2022-04-15 05:42:02,399 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-15 05:42:02,400 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-15 05:42:02,400 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-15 05:42:02,400 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-15 05:42:02,401 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-15 05:42:02,401 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-15 05:42:02,401 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-15 05:42:02,401 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-15 05:42:02,402 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-15 05:42:02,402 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-15 05:42:02,402 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-15 05:42:02,403 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-15 05:42:02,403 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-15 05:42:02,403 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-15 05:42:02,403 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-15 05:42:02,404 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-15 05:42:02,404 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-15 05:42:02,405 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-15 05:42:02,405 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-15 05:42:02,405 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-15 05:42:02,406 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-15 05:42:02,406 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-15 05:42:02,406 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-15 05:42:02,407 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-15 05:42:02,407 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-15 05:42:02,407 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-15 05:42:02,408 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-15 05:42:02,408 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-15 05:42:02,408 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-15 05:42:02,409 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-15 05:42:02,409 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-15 05:42:02,409 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-15 05:42:02,410 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-15 05:42:02,410 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-15 05:42:02,410 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-15 05:42:02,410 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-15 05:42:02,410 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-15 05:42:02,410 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-15 05:42:02,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-15 05:42:02,410 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-15 05:42:02,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:02,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-15 05:42:02,694 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-15 05:42:02,694 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-15 05:42:02,694 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-15 05:42:02,694 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-15 05:42:02,695 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-15 05:42:02,695 INFO L290 TraceCheckUtils]: 55: Hoare triple {9357#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-15 05:42:02,695 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-15 05:42:02,696 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-15 05:42:02,696 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-15 05:42:02,696 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-15 05:42:02,697 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-15 05:42:02,697 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-15 05:42:02,697 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-15 05:42:02,697 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-15 05:42:02,698 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-15 05:42:02,698 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-15 05:42:02,699 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-15 05:42:02,699 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-15 05:42:02,699 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-15 05:42:02,700 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-15 05:42:02,700 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-15 05:42:02,700 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-15 05:42:02,701 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-15 05:42:02,701 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-15 05:42:02,702 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-15 05:42:02,702 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-15 05:42:02,703 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-15 05:42:02,703 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-15 05:42:02,704 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-15 05:42:02,704 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-15 05:42:02,704 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-15 05:42:02,704 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-15 05:42:02,705 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-15 05:42:02,705 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-15 05:42:02,706 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-15 05:42:02,706 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-15 05:42:02,706 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-15 05:42:02,707 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-15 05:42:02,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {9126#true} ~i~0 := 0; {9126#true} is VALID [2022-04-15 05:42:02,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#true} assume !(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,707 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-15 05:42:02,707 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-15 05:42:02,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,707 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-15 05:42:02,707 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-15 05:42:02,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,707 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-15 05:42:02,708 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-15 05:42:02,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,708 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-15 05:42:02,708 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-15 05:42:02,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,708 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-15 05:42:02,708 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-15 05:42:02,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-15 05:42:02,708 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-15 05:42:02,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-15 05:42:02,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-15 05:42:02,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 05:42:02,708 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-15 05:42:02,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2022-04-15 05:42:02,710 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-15 05:42:02,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340737534] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:02,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:02,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-04-15 05:42:02,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:02,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [206948186] [2022-04-15 05:42:02,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [206948186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:02,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:02,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 05:42:02,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272095313] [2022-04-15 05:42:02,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:02,711 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-15 05:42:02,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:02,711 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-15 05:42:02,751 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-15 05:42:02,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 05:42:02,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:02,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 05:42:02,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 05:42:02,752 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-15 05:42:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:03,270 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-15 05:42:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 05:42:03,270 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-15 05:42:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:03,271 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-15 05:42:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-15 05:42:03,272 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-15 05:42:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-15 05:42:03,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-15 05:42:03,362 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-15 05:42:03,362 INFO L225 Difference]: With dead ends: 115 [2022-04-15 05:42:03,363 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 05:42:03,363 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-15 05:42:03,363 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-15 05:42:03,364 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-15 05:42:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 05:42:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-04-15 05:42:03,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:03,457 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-15 05:42:03,457 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-15 05:42:03,457 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-15 05:42:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:03,458 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-15 05:42:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-04-15 05:42:03,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:03,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:03,458 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-15 05:42:03,459 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-15 05:42:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:03,460 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-15 05:42:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-04-15 05:42:03,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:03,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:03,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:03,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:03,460 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-15 05:42:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-04-15 05:42:03,461 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 62 [2022-04-15 05:42:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:03,461 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2022-04-15 05:42:03,461 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-15 05:42:03,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 84 transitions. [2022-04-15 05:42:03,563 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-15 05:42:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2022-04-15 05:42:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 05:42:03,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:03,564 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-15 05:42:03,581 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-15 05:42:03,775 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-15 05:42:03,775 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1792029199, now seen corresponding path program 23 times [2022-04-15 05:42:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:03,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1350032184] [2022-04-15 05:42:03,780 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:03,781 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:03,781 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1792029199, now seen corresponding path program 24 times [2022-04-15 05:42:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:03,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383387067] [2022-04-15 05:42:03,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:03,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:04,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:04,014 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-15 05:42:04,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-15 05:42:04,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-15 05:42:04,015 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-15 05:42:04,015 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-15 05:42:04,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-15 05:42:04,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-15 05:42:04,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-15 05:42:04,016 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-15 05:42:04,017 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-15 05:42:04,017 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-15 05:42:04,017 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-15 05:42:04,017 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-15 05:42:04,018 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-15 05:42:04,018 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-15 05:42:04,018 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-15 05:42:04,019 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-15 05:42:04,019 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-15 05:42:04,019 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-15 05:42:04,019 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-15 05:42:04,020 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-15 05:42:04,020 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-15 05:42:04,020 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-15 05:42:04,020 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-15 05:42:04,021 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-15 05:42:04,021 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-15 05:42:04,021 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-15 05:42:04,022 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-15 05:42:04,022 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-15 05:42:04,023 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-15 05:42:04,023 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-15 05:42:04,024 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-15 05:42:04,024 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-15 05:42:04,025 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-15 05:42:04,025 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-15 05:42:04,026 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-15 05:42:04,026 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-15 05:42:04,026 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-15 05:42:04,027 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-15 05:42:04,027 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-15 05:42:04,028 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-15 05:42:04,028 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-15 05:42:04,029 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-15 05:42:04,029 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-15 05:42:04,030 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-15 05:42:04,030 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-15 05:42:04,031 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-15 05:42:04,031 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-15 05:42:04,031 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-15 05:42:04,032 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-15 05:42:04,032 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-15 05:42:04,033 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-15 05:42:04,033 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-15 05:42:04,034 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-15 05:42:04,034 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-15 05:42:04,034 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-15 05:42:04,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {10068#false} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-15 05:42:04,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-15 05:42:04,034 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-15 05:42:04,034 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-15 05:42:04,034 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-15 05:42:04,035 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-15 05:42:04,035 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-15 05:42:04,035 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-15 05:42:04,035 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-15 05:42:04,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-15 05:42:04,035 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-15 05:42:04,035 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-15 05:42:04,035 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-15 05:42:04,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:04,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383387067] [2022-04-15 05:42:04,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383387067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:04,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406403489] [2022-04-15 05:42:04,036 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:04,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:04,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:04,037 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-15 05:42:04,038 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-15 05:42:04,141 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:42:04,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:04,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:42:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:04,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:04,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10067#true} is VALID [2022-04-15 05:42:04,455 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-15 05:42:04,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-15 05:42:04,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-15 05:42:04,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-15 05:42:04,457 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-15 05:42:04,457 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-15 05:42:04,457 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-15 05:42:04,458 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-15 05:42:04,458 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-15 05:42:04,458 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-15 05:42:04,458 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-15 05:42:04,459 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-15 05:42:04,459 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-15 05:42:04,459 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-15 05:42:04,459 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-15 05:42:04,460 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-15 05:42:04,460 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-15 05:42:04,460 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-15 05:42:04,460 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-15 05:42:04,461 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-15 05:42:04,461 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-15 05:42:04,461 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-15 05:42:04,462 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-15 05:42:04,462 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-15 05:42:04,462 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-15 05:42:04,463 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-15 05:42:04,463 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-15 05:42:04,464 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-15 05:42:04,464 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-15 05:42:04,464 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-15 05:42:04,465 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-15 05:42:04,465 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-15 05:42:04,466 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-15 05:42:04,466 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-15 05:42:04,466 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-15 05:42:04,467 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-15 05:42:04,467 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-15 05:42:04,467 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-15 05:42:04,468 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-15 05:42:04,468 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-15 05:42:04,469 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-15 05:42:04,469 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-15 05:42:04,469 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-15 05:42:04,470 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-15 05:42:04,470 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-15 05:42:04,470 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-15 05:42:04,471 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-15 05:42:04,471 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-15 05:42:04,472 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-15 05:42:04,472 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-15 05:42:04,472 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-15 05:42:04,473 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-15 05:42:04,473 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-15 05:42:04,473 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-15 05:42:04,473 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-15 05:42:04,473 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-15 05:42:04,473 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-15 05:42:04,473 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-15 05:42:04,473 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-15 05:42:04,474 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-15 05:42:04,474 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-15 05:42:04,474 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-15 05:42:04,474 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-15 05:42:04,474 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-15 05:42:04,474 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-15 05:42:04,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:04,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-15 05:42:04,659 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-15 05:42:04,659 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-15 05:42:04,659 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-15 05:42:04,659 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-15 05:42:04,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-15 05:42:04,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-15 05:42:04,660 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-15 05:42:04,660 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-15 05:42:04,660 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-15 05:42:04,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-15 05:42:04,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {10315#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-15 05:42:04,661 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-15 05:42:04,661 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-15 05:42:04,661 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-15 05:42:04,661 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-15 05:42:04,662 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-15 05:42:04,662 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-15 05:42:04,662 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-15 05:42:04,662 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-15 05:42:04,663 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-15 05:42:04,663 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-15 05:42:04,663 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-15 05:42:04,663 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-15 05:42:04,664 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-15 05:42:04,664 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-15 05:42:04,664 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-15 05:42:04,664 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-15 05:42:04,665 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-15 05:42:04,665 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-15 05:42:04,665 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-15 05:42:04,665 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-15 05:42:04,666 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-15 05:42:04,666 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-15 05:42:04,666 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-15 05:42:04,666 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-15 05:42:04,667 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-15 05:42:04,667 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-15 05:42:04,667 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-15 05:42:04,668 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-15 05:42:04,668 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-15 05:42:04,668 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-15 05:42:04,668 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-15 05:42:04,673 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-15 05:42:04,674 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-15 05:42:04,675 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-15 05:42:04,677 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-15 05:42:04,677 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-15 05:42:04,680 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-15 05:42:04,680 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-15 05:42:04,681 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-15 05:42:04,681 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-15 05:42:04,681 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-15 05:42:04,682 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-15 05:42:04,683 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-15 05:42:04,685 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-15 05:42:04,685 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-15 05:42:04,686 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-15 05:42:04,686 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-15 05:42:04,687 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-15 05:42:04,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-15 05:42:04,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-15 05:42:04,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-15 05:42:04,688 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-15 05:42:04,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10067#true} is VALID [2022-04-15 05:42:04,688 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-15 05:42:04,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406403489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:04,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:04,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 20 [2022-04-15 05:42:04,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:04,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1350032184] [2022-04-15 05:42:04,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1350032184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:04,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:04,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 05:42:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325970002] [2022-04-15 05:42:04,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:04,689 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-15 05:42:04,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:04,690 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-15 05:42:04,724 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-15 05:42:04,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 05:42:04,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:04,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 05:42:04,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:42:04,725 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-15 05:42:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:05,216 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2022-04-15 05:42:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 05:42:05,217 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-15 05:42:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:05,217 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-15 05:42:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-15 05:42:05,218 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-15 05:42:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-15 05:42:05,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 101 transitions. [2022-04-15 05:42:05,292 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-15 05:42:05,293 INFO L225 Difference]: With dead ends: 121 [2022-04-15 05:42:05,293 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 05:42:05,293 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-15 05:42:05,294 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-15 05:42:05,294 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-15 05:42:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 05:42:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-04-15 05:42:05,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:05,391 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-15 05:42:05,391 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-15 05:42:05,392 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-15 05:42:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:05,393 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-15 05:42:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-04-15 05:42:05,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:05,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:05,393 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-15 05:42:05,393 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-15 05:42:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:05,394 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-15 05:42:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-04-15 05:42:05,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:05,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:05,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:05,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:05,395 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-15 05:42:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-15 05:42:05,395 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 65 [2022-04-15 05:42:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:05,396 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-15 05:42:05,396 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-15 05:42:05,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-15 05:42:05,506 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-15 05:42:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-15 05:42:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 05:42:05,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:05,506 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-15 05:42:05,522 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-15 05:42:05,715 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-15 05:42:05,715 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:05,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash 170568442, now seen corresponding path program 25 times [2022-04-15 05:42:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1618404871] [2022-04-15 05:42:05,720 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:05,721 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:05,721 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash 170568442, now seen corresponding path program 26 times [2022-04-15 05:42:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:05,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069821711] [2022-04-15 05:42:05,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:05,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:05,897 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-15 05:42:05,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-15 05:42:05,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-15 05:42:05,898 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-15 05:42:05,898 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-15 05:42:05,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-15 05:42:05,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-15 05:42:05,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-15 05:42:05,904 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-15 05:42:05,904 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-15 05:42:05,905 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-15 05:42:05,905 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-15 05:42:05,905 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-15 05:42:05,906 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-15 05:42:05,906 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-15 05:42:05,906 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-15 05:42:05,907 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-15 05:42:05,907 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-15 05:42:05,907 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-15 05:42:05,908 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-15 05:42:05,908 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-15 05:42:05,908 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-15 05:42:05,909 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-15 05:42:05,909 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-15 05:42:05,909 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-15 05:42:05,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {11044#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:05,910 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-15 05:42:05,911 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-15 05:42:05,911 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-15 05:42:05,912 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-15 05:42:05,912 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-15 05:42:05,912 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-15 05:42:05,913 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-15 05:42:05,913 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-15 05:42:05,914 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-15 05:42:05,914 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-15 05:42:05,914 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-15 05:42:05,915 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-15 05:42:05,915 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-15 05:42:05,916 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-15 05:42:05,916 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-15 05:42:05,916 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-15 05:42:05,917 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-15 05:42:05,917 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-15 05:42:05,918 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-15 05:42:05,918 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-15 05:42:05,919 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-15 05:42:05,919 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-15 05:42:05,919 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-15 05:42:05,920 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-15 05:42:05,920 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-15 05:42:05,920 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-15 05:42:05,921 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-15 05:42:05,921 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-15 05:42:05,921 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-15 05:42:05,922 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-15 05:42:05,922 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-15 05:42:05,922 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-15 05:42:05,922 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-15 05:42:05,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-15 05:42:05,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-15 05:42:05,923 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-15 05:42:05,923 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-15 05:42:05,923 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-15 05:42:05,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-15 05:42:05,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-15 05:42:05,923 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-15 05:42:05,923 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-15 05:42:05,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-15 05:42:05,923 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-15 05:42:05,923 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-15 05:42:05,924 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-15 05:42:05,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:05,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069821711] [2022-04-15 05:42:05,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069821711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:05,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594701154] [2022-04-15 05:42:05,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:05,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:05,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:05,925 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-15 05:42:05,926 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-15 05:42:06,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:06,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:06,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 05:42:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:06,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:06,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11039#true} is VALID [2022-04-15 05:42:06,596 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-15 05:42:06,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-15 05:42:06,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-15 05:42:06,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-15 05:42:06,601 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-15 05:42:06,601 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-15 05:42:06,601 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-15 05:42:06,602 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-15 05:42:06,602 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-15 05:42:06,602 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-15 05:42:06,603 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-15 05:42:06,603 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-15 05:42:06,603 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-15 05:42:06,604 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-15 05:42:06,604 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-15 05:42:06,604 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-15 05:42:06,605 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-15 05:42:06,605 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-15 05:42:06,605 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-15 05:42:06,606 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-15 05:42:06,606 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-15 05:42:06,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {11044#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:06,607 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-15 05:42:06,607 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-15 05:42:06,608 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-15 05:42:06,608 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-15 05:42:06,609 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-15 05:42:06,609 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-15 05:42:06,610 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-15 05:42:06,610 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-15 05:42:06,611 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-15 05:42:06,611 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-15 05:42:06,612 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-15 05:42:06,612 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-15 05:42:06,613 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-15 05:42:06,613 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-15 05:42:06,614 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-15 05:42:06,614 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-15 05:42:06,615 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-15 05:42:06,615 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-15 05:42:06,615 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-15 05:42:06,616 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-15 05:42:06,616 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-15 05:42:06,617 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-15 05:42:06,617 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-15 05:42:06,618 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-15 05:42:06,618 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-15 05:42:06,619 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-15 05:42:06,619 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-15 05:42:06,620 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-15 05:42:06,620 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-15 05:42:06,621 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-15 05:42:06,621 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-15 05:42:06,622 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-15 05:42:06,622 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-15 05:42:06,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-15 05:42:06,622 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-15 05:42:06,622 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-15 05:42:06,622 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-15 05:42:06,622 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-15 05:42:06,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-15 05:42:06,622 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-15 05:42:06,622 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-15 05:42:06,622 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-15 05:42:06,622 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-15 05:42:06,622 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-15 05:42:06,623 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-15 05:42:06,623 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-15 05:42:06,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:07,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-15 05:42:07,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-15 05:42:07,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-15 05:42:07,039 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-15 05:42:07,039 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-15 05:42:07,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-15 05:42:07,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-15 05:42:07,039 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-15 05:42:07,039 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-15 05:42:07,039 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-15 05:42:07,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-15 05:42:07,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-15 05:42:07,040 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-15 05:42:07,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {11311#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11040#false} is VALID [2022-04-15 05:42:07,042 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-15 05:42:07,042 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-15 05:42:07,043 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-15 05:42:07,043 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-15 05:42:07,044 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-15 05:42:07,044 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-15 05:42:07,045 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-15 05:42:07,045 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-15 05:42:07,045 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-15 05:42:07,046 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-15 05:42:07,046 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-15 05:42:07,046 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-15 05:42:07,047 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-15 05:42:07,047 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-15 05:42:07,047 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-15 05:42:07,048 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-15 05:42:07,048 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-15 05:42:07,049 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-15 05:42:07,049 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-15 05:42:07,049 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-15 05:42:07,050 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-15 05:42:07,050 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-15 05:42:07,050 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-15 05:42:07,051 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-15 05:42:07,051 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-15 05:42:07,051 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-15 05:42:07,052 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-15 05:42:07,052 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-15 05:42:07,052 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-15 05:42:07,053 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-15 05:42:07,053 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-15 05:42:07,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {11413#(<= 11 main_~edgecount~0)} ~i~0 := 0; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-15 05:42:07,054 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-15 05:42:07,054 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-15 05:42:07,054 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-15 05:42:07,054 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-15 05:42:07,055 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-15 05:42:07,055 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-15 05:42:07,055 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-15 05:42:07,056 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-15 05:42:07,056 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-15 05:42:07,056 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-15 05:42:07,056 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-15 05:42:07,057 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-15 05:42:07,057 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-15 05:42:07,057 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-15 05:42:07,058 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-15 05:42:07,058 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-15 05:42:07,060 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-15 05:42:07,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-15 05:42:07,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-15 05:42:07,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-15 05:42:07,060 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-15 05:42:07,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11039#true} is VALID [2022-04-15 05:42:07,061 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-15 05:42:07,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594701154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:07,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:07,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 36 [2022-04-15 05:42:07,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:07,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1618404871] [2022-04-15 05:42:07,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1618404871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:07,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:07,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 05:42:07,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075824127] [2022-04-15 05:42:07,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:07,062 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-15 05:42:07,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:07,062 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-15 05:42:07,106 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-15 05:42:07,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 05:42:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 05:42:07,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=746, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 05:42:07,107 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-15 05:42:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:07,758 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2022-04-15 05:42:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 05:42:07,758 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-15 05:42:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:07,758 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-15 05:42:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-04-15 05:42:07,759 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-15 05:42:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-04-15 05:42:07,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 105 transitions. [2022-04-15 05:42:07,840 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-15 05:42:07,841 INFO L225 Difference]: With dead ends: 127 [2022-04-15 05:42:07,841 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 05:42:07,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=816, Invalid=1440, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 05:42:07,842 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 158 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:07,842 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.2s Time] [2022-04-15 05:42:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 05:42:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-04-15 05:42:07,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:07,949 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-15 05:42:07,949 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-15 05:42:07,949 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-15 05:42:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:07,950 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-15 05:42:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-04-15 05:42:07,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:07,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:07,950 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-15 05:42:07,950 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-15 05:42:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:07,951 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-15 05:42:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-04-15 05:42:07,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:07,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:07,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:07,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:07,952 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-15 05:42:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2022-04-15 05:42:07,953 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 68 [2022-04-15 05:42:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:07,953 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2022-04-15 05:42:07,953 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-15 05:42:07,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 92 transitions. [2022-04-15 05:42:08,064 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-15 05:42:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2022-04-15 05:42:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 05:42:08,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:08,065 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-15 05:42:08,105 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-15 05:42:08,265 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-15 05:42:08,266 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 527091025, now seen corresponding path program 27 times [2022-04-15 05:42:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:08,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1422459958] [2022-04-15 05:42:08,271 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:08,271 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:08,271 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:08,271 INFO L85 PathProgramCache]: Analyzing trace with hash 527091025, now seen corresponding path program 28 times [2022-04-15 05:42:08,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:08,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191729746] [2022-04-15 05:42:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:08,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:08,479 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-15 05:42:08,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-15 05:42:08,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-15 05:42:08,480 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-15 05:42:08,480 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-15 05:42:08,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-15 05:42:08,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-15 05:42:08,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-15 05:42:08,482 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-15 05:42:08,483 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-15 05:42:08,483 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-15 05:42:08,483 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-15 05:42:08,484 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-15 05:42:08,484 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-15 05:42:08,484 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-15 05:42:08,485 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-15 05:42:08,485 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-15 05:42:08,485 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-15 05:42:08,486 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-15 05:42:08,486 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-15 05:42:08,486 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-15 05:42:08,487 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-15 05:42:08,487 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-15 05:42:08,487 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-15 05:42:08,488 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-15 05:42:08,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {12076#(<= 20 main_~edgecount~0)} ~i~0 := 0; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:08,488 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-15 05:42:08,489 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-15 05:42:08,489 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-15 05:42:08,490 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-15 05:42:08,490 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-15 05:42:08,491 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-15 05:42:08,491 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-15 05:42:08,491 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-15 05:42:08,492 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-15 05:42:08,492 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-15 05:42:08,493 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-15 05:42:08,493 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-15 05:42:08,493 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-15 05:42:08,494 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-15 05:42:08,495 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-15 05:42:08,495 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-15 05:42:08,496 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-15 05:42:08,496 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-15 05:42:08,496 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-15 05:42:08,497 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-15 05:42:08,497 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-15 05:42:08,498 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-15 05:42:08,498 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-15 05:42:08,499 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-15 05:42:08,499 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-15 05:42:08,500 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-15 05:42:08,500 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-15 05:42:08,500 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-15 05:42:08,501 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-15 05:42:08,501 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-15 05:42:08,502 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-15 05:42:08,502 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-15 05:42:08,502 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-15 05:42:08,503 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-15 05:42:08,503 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-15 05:42:08,504 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-15 05:42:08,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {12072#false} assume !(~i~0 < ~nodecount~0); {12072#false} is VALID [2022-04-15 05:42:08,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-15 05:42:08,504 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-15 05:42:08,504 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-15 05:42:08,504 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-15 05:42:08,504 INFO L290 TraceCheckUtils]: 64: Hoare triple {12072#false} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-15 05:42:08,504 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-15 05:42:08,504 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-15 05:42:08,504 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-15 05:42:08,505 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-15 05:42:08,505 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-15 05:42:08,505 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-15 05:42:08,505 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-15 05:42:08,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:08,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191729746] [2022-04-15 05:42:08,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191729746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:08,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229387336] [2022-04-15 05:42:08,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:08,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:08,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:08,520 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-15 05:42:08,521 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-15 05:42:08,679 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:08,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:08,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 05:42:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:08,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:09,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12071#true} is VALID [2022-04-15 05:42:09,141 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-15 05:42:09,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-15 05:42:09,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-15 05:42:09,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-15 05:42:09,141 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-15 05:42:09,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,141 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-15 05:42:09,141 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-15 05:42:09,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,141 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-15 05:42:09,142 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-15 05:42:09,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,142 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-15 05:42:09,142 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-15 05:42:09,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,142 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-15 05:42:09,142 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-15 05:42:09,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,142 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-15 05:42:09,142 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-15 05:42:09,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {12071#true} assume !(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {12071#true} ~i~0 := 0; {12071#true} is VALID [2022-04-15 05:42:09,143 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-15 05:42:09,143 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-15 05:42:09,144 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-15 05:42:09,144 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-15 05:42:09,145 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-15 05:42:09,145 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-15 05:42:09,145 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-15 05:42:09,146 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-15 05:42:09,146 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-15 05:42:09,146 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-15 05:42:09,147 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-15 05:42:09,147 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-15 05:42:09,147 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-15 05:42:09,148 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-15 05:42:09,148 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-15 05:42:09,148 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-15 05:42:09,149 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-15 05:42:09,149 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-15 05:42:09,149 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-15 05:42:09,150 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-15 05:42:09,150 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-15 05:42:09,150 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-15 05:42:09,151 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-15 05:42:09,151 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-15 05:42:09,151 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-15 05:42:09,152 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-15 05:42:09,152 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-15 05:42:09,152 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-15 05:42:09,153 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-15 05:42:09,153 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-15 05:42:09,153 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-15 05:42:09,154 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-15 05:42:09,154 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-15 05:42:09,154 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-15 05:42:09,155 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-15 05:42:09,155 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-15 05:42:09,155 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-15 05:42:09,156 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-15 05:42:09,156 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-15 05:42:09,156 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-15 05:42:09,157 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-15 05:42:09,157 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-15 05:42:09,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-15 05:42:09,157 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-15 05:42:09,157 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-15 05:42:09,158 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-15 05:42:09,158 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-15 05:42:09,158 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-15 05:42:09,158 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-15 05:42:09,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:09,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-15 05:42:09,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-15 05:42:09,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-15 05:42:09,568 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-15 05:42:09,568 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-15 05:42:09,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-15 05:42:09,568 INFO L290 TraceCheckUtils]: 64: Hoare triple {12335#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-15 05:42:09,569 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-15 05:42:09,569 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-15 05:42:09,570 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-15 05:42:09,570 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-15 05:42:09,570 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-15 05:42:09,570 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-15 05:42:09,571 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-15 05:42:09,571 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-15 05:42:09,571 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-15 05:42:09,572 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-15 05:42:09,574 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-15 05:42:09,575 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-15 05:42:09,575 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-15 05:42:09,575 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-15 05:42:09,576 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-15 05:42:09,576 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-15 05:42:09,576 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-15 05:42:09,577 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-15 05:42:09,577 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-15 05:42:09,578 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-15 05:42:09,578 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-15 05:42:09,579 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-15 05:42:09,579 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-15 05:42:09,579 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-15 05:42:09,580 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-15 05:42:09,580 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-15 05:42:09,582 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-15 05:42:09,582 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-15 05:42:09,583 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-15 05:42:09,583 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-15 05:42:09,583 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-15 05:42:09,584 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-15 05:42:09,584 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-15 05:42:09,584 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-15 05:42:09,585 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-15 05:42:09,585 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-15 05:42:09,585 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-15 05:42:09,586 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-15 05:42:09,586 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-15 05:42:09,587 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-15 05:42:09,587 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-15 05:42:09,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {12071#true} ~i~0 := 0; {12071#true} is VALID [2022-04-15 05:42:09,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {12071#true} assume !(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,587 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-15 05:42:09,587 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-15 05:42:09,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,587 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-15 05:42:09,587 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-15 05:42:09,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,588 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-15 05:42:09,588 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-15 05:42:09,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,588 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-15 05:42:09,588 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-15 05:42:09,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,588 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-15 05:42:09,588 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-15 05:42:09,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-15 05:42:09,588 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-15 05:42:09,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-15 05:42:09,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-15 05:42:09,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-15 05:42:09,589 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-15 05:42:09,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12071#true} is VALID [2022-04-15 05:42:09,589 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-15 05:42:09,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229387336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:09,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:09,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-04-15 05:42:09,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:09,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1422459958] [2022-04-15 05:42:09,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1422459958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:09,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:09,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 05:42:09,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730747998] [2022-04-15 05:42:09,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:09,590 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-15 05:42:09,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:09,590 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-15 05:42:09,648 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-15 05:42:09,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 05:42:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 05:42:09,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1359, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 05:42:09,649 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-15 05:42:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:10,328 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2022-04-15 05:42:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 05:42:10,329 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-15 05:42:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:10,329 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-15 05:42:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-04-15 05:42:10,330 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-15 05:42:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-04-15 05:42:10,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 109 transitions. [2022-04-15 05:42:10,414 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-15 05:42:10,415 INFO L225 Difference]: With dead ends: 133 [2022-04-15 05:42:10,415 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 05:42:10,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=607, Invalid=2363, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 05:42:10,416 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-15 05:42:10,416 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-15 05:42:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 05:42:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-15 05:42:10,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:10,544 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-15 05:42:10,544 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-15 05:42:10,544 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-15 05:42:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:10,545 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2022-04-15 05:42:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-04-15 05:42:10,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:10,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:10,546 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-15 05:42:10,546 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-15 05:42:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:10,547 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2022-04-15 05:42:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-04-15 05:42:10,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:10,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:10,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:10,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:10,547 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-15 05:42:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2022-04-15 05:42:10,548 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 71 [2022-04-15 05:42:10,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:10,548 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2022-04-15 05:42:10,548 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-15 05:42:10,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 96 transitions. [2022-04-15 05:42:10,700 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-15 05:42:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2022-04-15 05:42:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 05:42:10,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:10,701 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-15 05:42:10,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 05:42:10,901 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-15 05:42:10,902 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash 237238170, now seen corresponding path program 29 times [2022-04-15 05:42:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:10,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1197335087] [2022-04-15 05:42:10,907 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:10,907 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:10,908 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash 237238170, now seen corresponding path program 30 times [2022-04-15 05:42:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:10,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843998240] [2022-04-15 05:42:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:11,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:11,170 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-15 05:42:11,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-15 05:42:11,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-15 05:42:11,171 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-15 05:42:11,171 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-15 05:42:11,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-15 05:42:11,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-15 05:42:11,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-15 05:42:11,173 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-15 05:42:11,174 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-15 05:42:11,174 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-15 05:42:11,175 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-15 05:42:11,175 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-15 05:42:11,175 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-15 05:42:11,176 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-15 05:42:11,176 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-15 05:42:11,176 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-15 05:42:11,177 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-15 05:42:11,177 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-15 05:42:11,178 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-15 05:42:11,178 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-15 05:42:11,178 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-15 05:42:11,179 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-15 05:42:11,179 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-15 05:42:11,179 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-15 05:42:11,180 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-15 05:42:11,180 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-15 05:42:11,181 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-15 05:42:11,181 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-15 05:42:11,182 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-15 05:42:11,182 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-15 05:42:11,183 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-15 05:42:11,184 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-15 05:42:11,184 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-15 05:42:11,185 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-15 05:42:11,185 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-15 05:42:11,186 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-15 05:42:11,187 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-15 05:42:11,187 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-15 05:42:11,188 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-15 05:42:11,188 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-15 05:42:11,189 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-15 05:42:11,189 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-15 05:42:11,190 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-15 05:42:11,190 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-15 05:42:11,191 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-15 05:42:11,192 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-15 05:42:11,192 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-15 05:42:11,193 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-15 05:42:11,193 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-15 05:42:11,194 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-15 05:42:11,195 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-15 05:42:11,195 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-15 05:42:11,196 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-15 05:42:11,196 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-15 05:42:11,197 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-15 05:42:11,198 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-15 05:42:11,198 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-15 05:42:11,199 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-15 05:42:11,199 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-15 05:42:11,200 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-15 05:42:11,200 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-15 05:42:11,201 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-15 05:42:11,201 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-15 05:42:11,202 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-15 05:42:11,202 INFO L290 TraceCheckUtils]: 62: Hoare triple {13154#false} assume !(~i~0 < ~nodecount~0); {13154#false} is VALID [2022-04-15 05:42:11,202 INFO L290 TraceCheckUtils]: 63: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-15 05:42:11,202 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-15 05:42:11,202 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-15 05:42:11,202 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-15 05:42:11,202 INFO L290 TraceCheckUtils]: 67: Hoare triple {13154#false} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-15 05:42:11,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-15 05:42:11,203 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-15 05:42:11,203 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-15 05:42:11,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-15 05:42:11,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-15 05:42:11,203 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-15 05:42:11,204 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-15 05:42:11,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:11,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843998240] [2022-04-15 05:42:11,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843998240] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:11,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749366900] [2022-04-15 05:42:11,204 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:11,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:11,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:11,220 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-15 05:42:11,222 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-15 05:42:11,380 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:42:11,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:11,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:42:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:11,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:11,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-15 05:42:11,661 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-15 05:42:11,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-15 05:42:11,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-15 05:42:11,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-15 05:42:11,664 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-15 05:42:11,664 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-15 05:42:11,664 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-15 05:42:11,665 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-15 05:42:11,665 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-15 05:42:11,665 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-15 05:42:11,665 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-15 05:42:11,666 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-15 05:42:11,666 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-15 05:42:11,666 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-15 05:42:11,667 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-15 05:42:11,667 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-15 05:42:11,667 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-15 05:42:11,667 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-15 05:42:11,668 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-15 05:42:11,668 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-15 05:42:11,668 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-15 05:42:11,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {13191#(<= 20 main_~edgecount~0)} ~i~0 := 0; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:11,669 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-15 05:42:11,669 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-15 05:42:11,669 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-15 05:42:11,670 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-15 05:42:11,670 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-15 05:42:11,670 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-15 05:42:11,670 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-15 05:42:11,671 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-15 05:42:11,671 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-15 05:42:11,671 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-15 05:42:11,672 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-15 05:42:11,672 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-15 05:42:11,672 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-15 05:42:11,672 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-15 05:42:11,673 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-15 05:42:11,673 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-15 05:42:11,673 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-15 05:42:11,674 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-15 05:42:11,674 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-15 05:42:11,674 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-15 05:42:11,674 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-15 05:42:11,675 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-15 05:42:11,675 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-15 05:42:11,675 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-15 05:42:11,675 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-15 05:42:11,676 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-15 05:42:11,676 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-15 05:42:11,676 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-15 05:42:11,677 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-15 05:42:11,677 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-15 05:42:11,677 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-15 05:42:11,677 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-15 05:42:11,678 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-15 05:42:11,678 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-15 05:42:11,678 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-15 05:42:11,679 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-15 05:42:11,679 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-15 05:42:11,679 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-15 05:42:11,679 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-15 05:42:11,680 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-15 05:42:11,680 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-15 05:42:11,681 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-15 05:42:11,681 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-15 05:42:11,681 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-15 05:42:11,682 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-15 05:42:11,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-15 05:42:11,682 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-15 05:42:11,682 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-15 05:42:11,682 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-15 05:42:11,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-15 05:42:11,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-15 05:42:11,682 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-15 05:42:11,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:11,935 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-15 05:42:11,935 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-15 05:42:11,935 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-15 05:42:11,935 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-15 05:42:11,935 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-15 05:42:11,935 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-15 05:42:11,936 INFO L290 TraceCheckUtils]: 67: Hoare triple {13416#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-15 05:42:11,936 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-15 05:42:11,937 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-15 05:42:11,937 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-15 05:42:11,937 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-15 05:42:11,937 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-15 05:42:11,938 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-15 05:42:11,938 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-15 05:42:11,938 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-15 05:42:11,939 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-15 05:42:11,939 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-15 05:42:11,939 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-15 05:42:11,939 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-15 05:42:11,940 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-15 05:42:11,940 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-15 05:42:11,940 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-15 05:42:11,941 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-15 05:42:11,941 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-15 05:42:11,941 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-15 05:42:11,941 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-15 05:42:11,942 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-15 05:42:11,942 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-15 05:42:11,942 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-15 05:42:11,943 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-15 05:42:11,943 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-15 05:42:11,943 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-15 05:42:11,943 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-15 05:42:11,944 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-15 05:42:11,944 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-15 05:42:11,944 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-15 05:42:11,944 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-15 05:42:11,945 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-15 05:42:11,945 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-15 05:42:11,945 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-15 05:42:11,946 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-15 05:42:11,946 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-15 05:42:11,946 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-15 05:42:11,946 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-15 05:42:11,947 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-15 05:42:11,947 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-15 05:42:11,947 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-15 05:42:11,948 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-15 05:42:11,948 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-15 05:42:11,948 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-15 05:42:11,948 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-15 05:42:11,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {13430#(< 1 main_~edgecount~0)} ~i~0 := 0; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-15 05:42:11,949 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-15 05:42:11,949 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-15 05:42:11,950 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-15 05:42:11,950 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-15 05:42:11,950 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-15 05:42:11,951 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-15 05:42:11,951 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-15 05:42:11,951 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-15 05:42:11,951 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-15 05:42:11,952 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-15 05:42:11,952 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-15 05:42:11,952 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-15 05:42:11,953 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-15 05:42:11,953 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-15 05:42:11,953 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-15 05:42:11,953 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-15 05:42:11,955 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-15 05:42:11,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-15 05:42:11,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-15 05:42:11,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-15 05:42:11,956 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-15 05:42:11,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-15 05:42:11,956 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-15 05:42:11,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749366900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:11,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:11,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 23 [2022-04-15 05:42:11,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:11,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1197335087] [2022-04-15 05:42:11,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1197335087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:11,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:11,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 05:42:11,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472721766] [2022-04-15 05:42:11,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:11,957 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-15 05:42:11,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:11,957 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-15 05:42:12,012 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-15 05:42:12,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 05:42:12,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:12,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 05:42:12,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:42:12,013 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-15 05:42:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:12,736 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2022-04-15 05:42:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 05:42:12,737 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-15 05:42:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:12,737 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-15 05:42:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 113 transitions. [2022-04-15 05:42:12,738 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-15 05:42:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 113 transitions. [2022-04-15 05:42:12,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 113 transitions. [2022-04-15 05:42:12,853 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-15 05:42:12,854 INFO L225 Difference]: With dead ends: 139 [2022-04-15 05:42:12,854 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 05:42:12,854 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-15 05:42:12,855 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-15 05:42:12,855 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-15 05:42:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 05:42:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-15 05:42:13,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:13,015 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-15 05:42:13,015 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-15 05:42:13,015 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-15 05:42:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:13,016 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-04-15 05:42:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-04-15 05:42:13,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:13,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:13,017 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-15 05:42:13,017 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-15 05:42:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:13,018 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-04-15 05:42:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-04-15 05:42:13,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:13,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:13,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:13,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:13,019 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-15 05:42:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-04-15 05:42:13,022 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 74 [2022-04-15 05:42:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:13,023 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-04-15 05:42:13,023 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-15 05:42:13,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 100 transitions. [2022-04-15 05:42:13,166 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-15 05:42:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-04-15 05:42:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 05:42:13,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:13,166 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-15 05:42:13,183 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-15 05:42:13,383 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-15 05:42:13,383 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:13,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:13,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1884900175, now seen corresponding path program 31 times [2022-04-15 05:42:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:13,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463510385] [2022-04-15 05:42:13,386 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:13,386 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:13,386 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1884900175, now seen corresponding path program 32 times [2022-04-15 05:42:13,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:13,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285674232] [2022-04-15 05:42:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:13,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:13,567 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-15 05:42:13,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-15 05:42:13,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-15 05:42:13,568 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-15 05:42:13,568 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-15 05:42:13,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-15 05:42:13,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-15 05:42:13,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-15 05:42:13,570 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-15 05:42:13,570 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-15 05:42:13,571 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-15 05:42:13,571 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-15 05:42:13,571 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-15 05:42:13,571 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-15 05:42:13,572 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-15 05:42:13,572 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-15 05:42:13,572 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-15 05:42:13,572 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-15 05:42:13,573 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-15 05:42:13,573 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-15 05:42:13,573 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-15 05:42:13,574 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-15 05:42:13,574 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-15 05:42:13,574 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-15 05:42:13,574 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-15 05:42:13,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {14265#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:13,575 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-15 05:42:13,576 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-15 05:42:13,576 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-15 05:42:13,576 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-15 05:42:13,577 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-15 05:42:13,577 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-15 05:42:13,577 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-15 05:42:13,578 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-15 05:42:13,578 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-15 05:42:13,578 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-15 05:42:13,579 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-15 05:42:13,579 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-15 05:42:13,579 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-15 05:42:13,580 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-15 05:42:13,580 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-15 05:42:13,580 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-15 05:42:13,581 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-15 05:42:13,581 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-15 05:42:13,582 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-15 05:42:13,582 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-15 05:42:13,582 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-15 05:42:13,583 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-15 05:42:13,583 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-15 05:42:13,583 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-15 05:42:13,584 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-15 05:42:13,584 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-15 05:42:13,584 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-15 05:42:13,585 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-15 05:42:13,585 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-15 05:42:13,585 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-15 05:42:13,586 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-15 05:42:13,586 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-15 05:42:13,586 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-15 05:42:13,587 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-15 05:42:13,587 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-15 05:42:13,587 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-15 05:42:13,588 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-15 05:42:13,588 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-15 05:42:13,588 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-15 05:42:13,589 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-15 05:42:13,589 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-15 05:42:13,589 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-15 05:42:13,589 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-15 05:42:13,589 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-15 05:42:13,589 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-15 05:42:13,590 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-15 05:42:13,590 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-15 05:42:13,590 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-15 05:42:13,590 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-15 05:42:13,590 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-15 05:42:13,590 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-15 05:42:13,590 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-15 05:42:13,590 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-15 05:42:13,590 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-15 05:42:13,590 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-15 05:42:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:13,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285674232] [2022-04-15 05:42:13,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285674232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:13,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114108889] [2022-04-15 05:42:13,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:13,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:13,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:13,592 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-15 05:42:13,594 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-15 05:42:13,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:13,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:13,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 05:42:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:13,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:14,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14260#true} is VALID [2022-04-15 05:42:14,334 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-15 05:42:14,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-15 05:42:14,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-15 05:42:14,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-15 05:42:14,336 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-15 05:42:14,337 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-15 05:42:14,337 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-15 05:42:14,337 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-15 05:42:14,337 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-15 05:42:14,338 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-15 05:42:14,338 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-15 05:42:14,338 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-15 05:42:14,338 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-15 05:42:14,339 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-15 05:42:14,339 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-15 05:42:14,339 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-15 05:42:14,339 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-15 05:42:14,340 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-15 05:42:14,340 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-15 05:42:14,340 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-15 05:42:14,340 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-15 05:42:14,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {14265#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:14,341 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-15 05:42:14,342 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-15 05:42:14,342 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-15 05:42:14,342 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-15 05:42:14,343 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-15 05:42:14,343 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-15 05:42:14,344 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-15 05:42:14,344 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-15 05:42:14,344 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-15 05:42:14,345 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-15 05:42:14,345 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-15 05:42:14,346 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-15 05:42:14,346 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-15 05:42:14,347 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-15 05:42:14,347 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-15 05:42:14,347 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-15 05:42:14,348 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-15 05:42:14,348 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-15 05:42:14,349 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-15 05:42:14,349 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-15 05:42:14,349 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-15 05:42:14,350 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-15 05:42:14,350 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-15 05:42:14,351 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-15 05:42:14,351 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-15 05:42:14,351 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-15 05:42:14,352 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-15 05:42:14,352 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-15 05:42:14,353 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-15 05:42:14,353 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-15 05:42:14,353 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-15 05:42:14,354 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-15 05:42:14,354 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-15 05:42:14,355 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-15 05:42:14,355 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-15 05:42:14,355 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-15 05:42:14,356 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-15 05:42:14,356 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-15 05:42:14,357 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-15 05:42:14,357 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-15 05:42:14,357 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-15 05:42:14,358 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-15 05:42:14,358 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-15 05:42:14,358 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-15 05:42:14,358 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-15 05:42:14,358 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-15 05:42:14,358 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-15 05:42:14,358 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-15 05:42:14,358 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-15 05:42:14,358 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-15 05:42:14,358 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-15 05:42:14,358 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-15 05:42:14,358 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-15 05:42:14,358 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-15 05:42:14,359 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-15 05:42:14,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:14,810 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-15 05:42:14,810 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-15 05:42:14,810 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-15 05:42:14,810 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-15 05:42:14,810 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-15 05:42:14,810 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-15 05:42:14,811 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-15 05:42:14,811 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-15 05:42:14,811 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-15 05:42:14,811 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-15 05:42:14,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-15 05:42:14,811 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-15 05:42:14,811 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-15 05:42:14,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {14565#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14261#false} is VALID [2022-04-15 05:42:14,812 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-15 05:42:14,812 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-15 05:42:14,812 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-15 05:42:14,813 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-15 05:42:14,813 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-15 05:42:14,814 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-15 05:42:14,814 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-15 05:42:14,815 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-15 05:42:14,815 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-15 05:42:14,816 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-15 05:42:14,816 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-15 05:42:14,816 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-15 05:42:14,816 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-15 05:42:14,817 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-15 05:42:14,817 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-15 05:42:14,817 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-15 05:42:14,818 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-15 05:42:14,818 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-15 05:42:14,819 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-15 05:42:14,819 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-15 05:42:14,819 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-15 05:42:14,819 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-15 05:42:14,820 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-15 05:42:14,820 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-15 05:42:14,821 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-15 05:42:14,821 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-15 05:42:14,821 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-15 05:42:14,822 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-15 05:42:14,822 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-15 05:42:14,822 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-15 05:42:14,823 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-15 05:42:14,823 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-15 05:42:14,823 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-15 05:42:14,824 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-15 05:42:14,824 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-15 05:42:14,824 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-15 05:42:14,825 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-15 05:42:14,825 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-15 05:42:14,826 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-15 05:42:14,826 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-15 05:42:14,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {14691#(<= 14 main_~edgecount~0)} ~i~0 := 0; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-15 05:42:14,827 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-15 05:42:14,827 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-15 05:42:14,827 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-15 05:42:14,828 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-15 05:42:14,828 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-15 05:42:14,828 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-15 05:42:14,828 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-15 05:42:14,829 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-15 05:42:14,829 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-15 05:42:14,829 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-15 05:42:14,830 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-15 05:42:14,830 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-15 05:42:14,830 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-15 05:42:14,831 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-15 05:42:14,831 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-15 05:42:14,831 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-15 05:42:14,833 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-15 05:42:14,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-15 05:42:14,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-15 05:42:14,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-15 05:42:14,834 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-15 05:42:14,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14260#true} is VALID [2022-04-15 05:42:14,834 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-15 05:42:14,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114108889] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:14,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:14,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 39 [2022-04-15 05:42:14,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:14,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463510385] [2022-04-15 05:42:14,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463510385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:14,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:14,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 05:42:14,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145539917] [2022-04-15 05:42:14,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:14,835 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-15 05:42:14,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:14,836 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-15 05:42:14,902 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-15 05:42:14,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 05:42:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:14,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 05:42:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=589, Invalid=893, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 05:42:14,903 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-15 05:42:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:15,742 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2022-04-15 05:42:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 05:42:15,742 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-15 05:42:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:15,743 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-15 05:42:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-15 05:42:15,744 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-15 05:42:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-15 05:42:15,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2022-04-15 05:42:15,844 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-15 05:42:15,845 INFO L225 Difference]: With dead ends: 145 [2022-04-15 05:42:15,845 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 05:42:15,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=972, Invalid=1890, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 05:42:15,846 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-15 05:42:15,846 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-15 05:42:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 05:42:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-04-15 05:42:16,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:16,005 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-15 05:42:16,005 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-15 05:42:16,005 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-15 05:42:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:16,006 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-04-15 05:42:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-15 05:42:16,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:16,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:16,007 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-15 05:42:16,007 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-15 05:42:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:16,008 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-04-15 05:42:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-15 05:42:16,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:16,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:16,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:16,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:16,008 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-15 05:42:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2022-04-15 05:42:16,009 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 77 [2022-04-15 05:42:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:16,010 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2022-04-15 05:42:16,010 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-15 05:42:16,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 104 transitions. [2022-04-15 05:42:16,151 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-15 05:42:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-04-15 05:42:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 05:42:16,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:16,152 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-15 05:42:16,176 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-15 05:42:16,352 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-15 05:42:16,353 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:16,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash -589738950, now seen corresponding path program 33 times [2022-04-15 05:42:16,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:16,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1534194781] [2022-04-15 05:42:16,365 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:16,366 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:16,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:16,366 INFO L85 PathProgramCache]: Analyzing trace with hash -589738950, now seen corresponding path program 34 times [2022-04-15 05:42:16,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:16,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907017873] [2022-04-15 05:42:16,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:16,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:16,624 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-15 05:42:16,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-15 05:42:16,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-15 05:42:16,625 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-15 05:42:16,625 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-15 05:42:16,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-15 05:42:16,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-15 05:42:16,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-15 05:42:16,626 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-15 05:42:16,627 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-15 05:42:16,627 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-15 05:42:16,628 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-15 05:42:16,628 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-15 05:42:16,628 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-15 05:42:16,629 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-15 05:42:16,629 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-15 05:42:16,629 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-15 05:42:16,630 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-15 05:42:16,630 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-15 05:42:16,630 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-15 05:42:16,631 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-15 05:42:16,631 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-15 05:42:16,631 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-15 05:42:16,631 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-15 05:42:16,632 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-15 05:42:16,632 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-15 05:42:16,632 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-15 05:42:16,633 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-15 05:42:16,633 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-15 05:42:16,634 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-15 05:42:16,634 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-15 05:42:16,635 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-15 05:42:16,635 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-15 05:42:16,636 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-15 05:42:16,636 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-15 05:42:16,636 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-15 05:42:16,637 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-15 05:42:16,637 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-15 05:42:16,638 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-15 05:42:16,638 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-15 05:42:16,639 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-15 05:42:16,639 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-15 05:42:16,640 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-15 05:42:16,640 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-15 05:42:16,641 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-15 05:42:16,641 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-15 05:42:16,642 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-15 05:42:16,642 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-15 05:42:16,643 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-15 05:42:16,643 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-15 05:42:16,644 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-15 05:42:16,644 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-15 05:42:16,645 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-15 05:42:16,645 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-15 05:42:16,646 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-15 05:42:16,646 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-15 05:42:16,646 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-15 05:42:16,647 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-15 05:42:16,647 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-15 05:42:16,648 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-15 05:42:16,648 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-15 05:42:16,649 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-15 05:42:16,649 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-15 05:42:16,650 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-15 05:42:16,650 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-15 05:42:16,651 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-15 05:42:16,651 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-15 05:42:16,652 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-15 05:42:16,652 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-15 05:42:16,653 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-15 05:42:16,653 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-15 05:42:16,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {15428#false} assume !(~i~0 < ~nodecount~0); {15428#false} is VALID [2022-04-15 05:42:16,653 INFO L290 TraceCheckUtils]: 69: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-15 05:42:16,653 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-15 05:42:16,653 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-15 05:42:16,653 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-15 05:42:16,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {15428#false} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-15 05:42:16,653 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-15 05:42:16,653 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-15 05:42:16,653 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-15 05:42:16,653 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-15 05:42:16,653 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-15 05:42:16,654 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-15 05:42:16,654 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-15 05:42:16,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907017873] [2022-04-15 05:42:16,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907017873] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158410792] [2022-04-15 05:42:16,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:16,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:16,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:16,655 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-15 05:42:16,656 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-15 05:42:16,805 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:16,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:16,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 05:42:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:16,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:17,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15427#true} is VALID [2022-04-15 05:42:17,281 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-15 05:42:17,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-15 05:42:17,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-15 05:42:17,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-15 05:42:17,281 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-15 05:42:17,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,281 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-15 05:42:17,281 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-15 05:42:17,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,281 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-15 05:42:17,281 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-15 05:42:17,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,281 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-15 05:42:17,281 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-15 05:42:17,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,282 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-15 05:42:17,282 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-15 05:42:17,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,282 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-15 05:42:17,282 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-15 05:42:17,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {15427#true} assume !(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {15427#true} ~i~0 := 0; {15427#true} is VALID [2022-04-15 05:42:17,283 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-15 05:42:17,283 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-15 05:42:17,283 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-15 05:42:17,284 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-15 05:42:17,284 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-15 05:42:17,284 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-15 05:42:17,285 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-15 05:42:17,285 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-15 05:42:17,285 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-15 05:42:17,286 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-15 05:42:17,286 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-15 05:42:17,286 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-15 05:42:17,287 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-15 05:42:17,287 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-15 05:42:17,287 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-15 05:42:17,288 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-15 05:42:17,288 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-15 05:42:17,288 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-15 05:42:17,289 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-15 05:42:17,289 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-15 05:42:17,289 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-15 05:42:17,290 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-15 05:42:17,290 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-15 05:42:17,290 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-15 05:42:17,291 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-15 05:42:17,291 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-15 05:42:17,292 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-15 05:42:17,292 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-15 05:42:17,292 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-15 05:42:17,292 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-15 05:42:17,293 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-15 05:42:17,293 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-15 05:42:17,293 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-15 05:42:17,294 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-15 05:42:17,294 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-15 05:42:17,294 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-15 05:42:17,295 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-15 05:42:17,295 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-15 05:42:17,295 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-15 05:42:17,296 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-15 05:42:17,296 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-15 05:42:17,297 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-15 05:42:17,297 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-15 05:42:17,297 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-15 05:42:17,298 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-15 05:42:17,298 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-15 05:42:17,298 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-15 05:42:17,299 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-15 05:42:17,299 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-15 05:42:17,300 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-15 05:42:17,300 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-15 05:42:17,300 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-15 05:42:17,300 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-15 05:42:17,300 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-15 05:42:17,300 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-15 05:42:17,300 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-15 05:42:17,301 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-15 05:42:17,301 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-15 05:42:17,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:17,798 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-15 05:42:17,798 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-15 05:42:17,798 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-15 05:42:17,799 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-15 05:42:17,799 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-15 05:42:17,799 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-15 05:42:17,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {15724#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-15 05:42:17,799 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-15 05:42:17,800 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-15 05:42:17,800 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-15 05:42:17,800 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-15 05:42:17,801 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-15 05:42:17,801 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-15 05:42:17,801 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-15 05:42:17,801 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-15 05:42:17,802 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-15 05:42:17,802 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-15 05:42:17,803 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-15 05:42:17,803 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-15 05:42:17,803 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-15 05:42:17,804 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-15 05:42:17,804 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-15 05:42:17,804 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-15 05:42:17,815 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-15 05:42:17,816 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-15 05:42:17,816 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-15 05:42:17,817 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-15 05:42:17,817 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-15 05:42:17,818 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-15 05:42:17,818 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-15 05:42:17,818 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-15 05:42:17,818 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-15 05:42:17,819 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-15 05:42:17,819 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-15 05:42:17,819 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-15 05:42:17,820 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-15 05:42:17,820 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-15 05:42:17,821 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-15 05:42:17,821 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-15 05:42:17,821 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-15 05:42:17,821 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-15 05:42:17,822 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-15 05:42:17,822 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-15 05:42:17,822 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-15 05:42:17,823 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-15 05:42:17,823 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-15 05:42:17,823 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-15 05:42:17,824 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-15 05:42:17,824 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-15 05:42:17,824 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-15 05:42:17,839 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-15 05:42:17,840 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-15 05:42:17,840 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-15 05:42:17,840 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-15 05:42:17,841 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-15 05:42:17,841 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-15 05:42:17,841 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-15 05:42:17,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {15427#true} ~i~0 := 0; {15427#true} is VALID [2022-04-15 05:42:17,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {15427#true} assume !(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,841 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-15 05:42:17,841 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-15 05:42:17,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,842 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-15 05:42:17,842 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-15 05:42:17,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,842 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-15 05:42:17,842 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-15 05:42:17,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,842 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-15 05:42:17,842 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-15 05:42:17,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,842 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-15 05:42:17,842 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-15 05:42:17,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-15 05:42:17,842 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-15 05:42:17,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-15 05:42:17,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-15 05:42:17,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-15 05:42:17,843 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-15 05:42:17,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15427#true} is VALID [2022-04-15 05:42:17,843 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-15 05:42:17,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158410792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:17,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:17,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2022-04-15 05:42:17,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:17,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1534194781] [2022-04-15 05:42:17,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1534194781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:17,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:17,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 05:42:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820486055] [2022-04-15 05:42:17,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:17,844 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-15 05:42:17,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:17,845 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-15 05:42:17,891 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-15 05:42:17,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 05:42:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 05:42:17,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=1950, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 05:42:17,892 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-15 05:42:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:18,658 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2022-04-15 05:42:18,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 05:42:18,658 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-15 05:42:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:18,658 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-15 05:42:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-04-15 05:42:18,659 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-15 05:42:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-04-15 05:42:18,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 121 transitions. [2022-04-15 05:42:18,754 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-15 05:42:18,755 INFO L225 Difference]: With dead ends: 151 [2022-04-15 05:42:18,755 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 05:42:18,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=949, Invalid=3473, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 05:42:18,757 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-15 05:42:18,757 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-15 05:42:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 05:42:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-04-15 05:42:18,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:18,924 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-15 05:42:18,925 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-15 05:42:18,925 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-15 05:42:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:18,926 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-04-15 05:42:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-04-15 05:42:18,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:18,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:18,926 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-15 05:42:18,926 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-15 05:42:18,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:18,927 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-04-15 05:42:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-04-15 05:42:18,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:18,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:18,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:18,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:18,928 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-15 05:42:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2022-04-15 05:42:18,929 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 80 [2022-04-15 05:42:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:18,929 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2022-04-15 05:42:18,929 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-15 05:42:18,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 108 transitions. [2022-04-15 05:42:19,075 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-15 05:42:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-04-15 05:42:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 05:42:19,076 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:19,076 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-15 05:42:19,094 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-15 05:42:19,276 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-15 05:42:19,276 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:19,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:19,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1867095057, now seen corresponding path program 35 times [2022-04-15 05:42:19,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:19,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [941502793] [2022-04-15 05:42:19,280 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:19,280 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:19,280 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1867095057, now seen corresponding path program 36 times [2022-04-15 05:42:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:19,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182250347] [2022-04-15 05:42:19,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:19,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:19,508 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-15 05:42:19,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-15 05:42:19,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-15 05:42:19,509 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-15 05:42:19,509 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-15 05:42:19,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-15 05:42:19,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-15 05:42:19,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-15 05:42:19,511 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-15 05:42:19,511 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-15 05:42:19,512 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-15 05:42:19,512 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-15 05:42:19,512 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-15 05:42:19,512 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-15 05:42:19,513 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-15 05:42:19,513 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-15 05:42:19,513 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-15 05:42:19,514 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-15 05:42:19,514 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-15 05:42:19,514 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-15 05:42:19,515 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-15 05:42:19,515 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-15 05:42:19,515 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-15 05:42:19,516 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-15 05:42:19,516 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-15 05:42:19,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {16655#(<= 20 main_~edgecount~0)} ~i~0 := 0; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:19,517 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-15 05:42:19,517 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-15 05:42:19,518 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-15 05:42:19,518 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-15 05:42:19,518 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-15 05:42:19,518 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-15 05:42:19,519 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-15 05:42:19,519 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-15 05:42:19,519 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-15 05:42:19,520 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-15 05:42:19,520 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-15 05:42:19,521 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-15 05:42:19,521 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-15 05:42:19,521 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-15 05:42:19,522 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-15 05:42:19,522 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-15 05:42:19,523 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-15 05:42:19,523 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-15 05:42:19,523 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-15 05:42:19,524 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-15 05:42:19,524 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-15 05:42:19,525 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-15 05:42:19,525 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-15 05:42:19,525 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-15 05:42:19,526 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-15 05:42:19,526 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-15 05:42:19,526 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-15 05:42:19,527 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-15 05:42:19,527 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-15 05:42:19,527 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-15 05:42:19,528 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-15 05:42:19,528 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-15 05:42:19,528 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-15 05:42:19,529 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-15 05:42:19,529 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-15 05:42:19,530 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-15 05:42:19,530 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-15 05:42:19,530 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-15 05:42:19,531 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-15 05:42:19,531 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-15 05:42:19,531 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-15 05:42:19,532 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-15 05:42:19,532 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-15 05:42:19,532 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-15 05:42:19,533 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-15 05:42:19,533 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-15 05:42:19,534 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-15 05:42:19,534 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-15 05:42:19,534 INFO L290 TraceCheckUtils]: 71: Hoare triple {16651#false} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-15 05:42:19,534 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-15 05:42:19,534 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-15 05:42:19,534 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-15 05:42:19,534 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-15 05:42:19,534 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-15 05:42:19,534 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-15 05:42:19,534 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-15 05:42:19,534 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-15 05:42:19,534 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-15 05:42:19,535 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-15 05:42:19,535 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-15 05:42:19,535 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-15 05:42:19,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:19,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182250347] [2022-04-15 05:42:19,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182250347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:19,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066963927] [2022-04-15 05:42:19,535 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:19,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:19,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:19,536 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-15 05:42:19,537 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-15 05:42:19,678 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:42:19,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:19,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:42:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:19,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:20,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16650#true} is VALID [2022-04-15 05:42:20,127 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-15 05:42:20,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-15 05:42:20,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-15 05:42:20,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-15 05:42:20,131 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-15 05:42:20,131 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-15 05:42:20,132 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-15 05:42:20,132 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-15 05:42:20,132 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-15 05:42:20,132 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-15 05:42:20,133 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-15 05:42:20,134 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-15 05:42:20,134 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-15 05:42:20,134 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-15 05:42:20,135 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-15 05:42:20,135 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-15 05:42:20,135 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-15 05:42:20,135 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-15 05:42:20,136 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-15 05:42:20,136 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-15 05:42:20,136 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-15 05:42:20,136 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-15 05:42:20,137 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-15 05:42:20,137 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-15 05:42:20,138 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-15 05:42:20,138 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-15 05:42:20,138 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-15 05:42:20,139 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-15 05:42:20,139 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-15 05:42:20,140 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-15 05:42:20,140 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-15 05:42:20,140 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-15 05:42:20,141 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-15 05:42:20,141 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-15 05:42:20,142 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-15 05:42:20,142 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-15 05:42:20,142 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-15 05:42:20,143 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-15 05:42:20,143 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-15 05:42:20,143 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-15 05:42:20,144 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-15 05:42:20,144 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-15 05:42:20,145 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-15 05:42:20,145 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-15 05:42:20,145 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-15 05:42:20,146 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-15 05:42:20,146 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-15 05:42:20,147 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-15 05:42:20,147 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-15 05:42:20,147 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-15 05:42:20,148 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-15 05:42:20,162 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-15 05:42:20,162 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-15 05:42:20,163 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-15 05:42:20,163 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-15 05:42:20,163 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-15 05:42:20,164 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-15 05:42:20,164 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-15 05:42:20,165 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-15 05:42:20,165 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-15 05:42:20,165 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-15 05:42:20,166 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-15 05:42:20,166 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-15 05:42:20,167 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-15 05:42:20,167 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-15 05:42:20,167 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-15 05:42:20,168 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-15 05:42:20,168 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-15 05:42:20,168 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-15 05:42:20,169 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-15 05:42:20,169 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-15 05:42:20,169 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-15 05:42:20,169 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-15 05:42:20,169 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-15 05:42:20,169 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-15 05:42:20,169 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-15 05:42:20,170 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-15 05:42:20,170 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-15 05:42:20,170 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-15 05:42:20,170 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-15 05:42:20,170 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-15 05:42:20,170 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-15 05:42:20,170 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-15 05:42:20,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:20,467 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-15 05:42:20,467 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-15 05:42:20,467 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-15 05:42:20,467 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-15 05:42:20,468 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-15 05:42:20,468 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-15 05:42:20,468 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-15 05:42:20,468 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-15 05:42:20,468 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-15 05:42:20,468 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-15 05:42:20,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-15 05:42:20,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {16958#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-15 05:42:20,469 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-15 05:42:20,469 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-15 05:42:20,469 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-15 05:42:20,470 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-15 05:42:20,470 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-15 05:42:20,470 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-15 05:42:20,471 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-15 05:42:20,471 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-15 05:42:20,471 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-15 05:42:20,471 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-15 05:42:20,472 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-15 05:42:20,472 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-15 05:42:20,472 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-15 05:42:20,473 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-15 05:42:20,473 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-15 05:42:20,473 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-15 05:42:20,473 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-15 05:42:20,474 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-15 05:42:20,474 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-15 05:42:20,474 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-15 05:42:20,475 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-15 05:42:20,475 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-15 05:42:20,475 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-15 05:42:20,475 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-15 05:42:20,476 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-15 05:42:20,476 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-15 05:42:20,476 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-15 05:42:20,476 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-15 05:42:20,478 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-15 05:42:20,478 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-15 05:42:20,478 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-15 05:42:20,478 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-15 05:42:20,479 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-15 05:42:20,479 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-15 05:42:20,479 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-15 05:42:20,479 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-15 05:42:20,480 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-15 05:42:20,480 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-15 05:42:20,480 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-15 05:42:20,480 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-15 05:42:20,481 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-15 05:42:20,481 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-15 05:42:20,481 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-15 05:42:20,481 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-15 05:42:20,482 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-15 05:42:20,482 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-15 05:42:20,483 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-15 05:42:20,483 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-15 05:42:20,483 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-15 05:42:20,484 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-15 05:42:20,484 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-15 05:42:20,484 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-15 05:42:20,484 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-15 05:42:20,485 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-15 05:42:20,485 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-15 05:42:20,485 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-15 05:42:20,485 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-15 05:42:20,486 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-15 05:42:20,486 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-15 05:42:20,486 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-15 05:42:20,486 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-15 05:42:20,487 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-15 05:42:20,487 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-15 05:42:20,487 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-15 05:42:20,487 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-15 05:42:20,489 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-15 05:42:20,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-15 05:42:20,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-15 05:42:20,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-15 05:42:20,489 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-15 05:42:20,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16650#true} is VALID [2022-04-15 05:42:20,490 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-15 05:42:20,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066963927] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:20,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:20,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 5, 5] total 26 [2022-04-15 05:42:20,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:20,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [941502793] [2022-04-15 05:42:20,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [941502793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:20,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:20,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 05:42:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337871173] [2022-04-15 05:42:20,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:20,491 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-15 05:42:20,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:20,491 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-15 05:42:20,545 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-15 05:42:20,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 05:42:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 05:42:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:42:20,546 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-15 05:42:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:21,376 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2022-04-15 05:42:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 05:42:21,376 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-15 05:42:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:21,377 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-15 05:42:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2022-04-15 05:42:21,378 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-15 05:42:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2022-04-15 05:42:21,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 125 transitions. [2022-04-15 05:42:21,475 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-15 05:42:21,476 INFO L225 Difference]: With dead ends: 157 [2022-04-15 05:42:21,476 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 05:42:21,477 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-15 05:42:21,477 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 208 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:21,478 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.2s Time] [2022-04-15 05:42:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 05:42:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-15 05:42:21,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:21,646 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-15 05:42:21,646 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-15 05:42:21,646 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-15 05:42:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:21,647 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-15 05:42:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-15 05:42:21,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:21,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:21,648 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-15 05:42:21,648 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-15 05:42:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:21,649 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-15 05:42:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-15 05:42:21,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:21,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:21,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:21,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:21,649 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-15 05:42:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-15 05:42:21,650 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 83 [2022-04-15 05:42:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:21,650 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-15 05:42:21,651 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-15 05:42:21,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-15 05:42:21,807 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-15 05:42:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-15 05:42:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 05:42:21,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:21,808 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-15 05:42:21,826 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-15 05:42:22,015 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-15 05:42:22,015 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:22,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1423660838, now seen corresponding path program 37 times [2022-04-15 05:42:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:22,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2091386390] [2022-04-15 05:42:22,019 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:22,019 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:22,019 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1423660838, now seen corresponding path program 38 times [2022-04-15 05:42:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:22,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662579409] [2022-04-15 05:42:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:22,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:22,256 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-15 05:42:22,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-15 05:42:22,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-15 05:42:22,257 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-15 05:42:22,257 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-15 05:42:22,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-15 05:42:22,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-15 05:42:22,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-15 05:42:22,259 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-15 05:42:22,259 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-15 05:42:22,259 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-15 05:42:22,260 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-15 05:42:22,260 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-15 05:42:22,260 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-15 05:42:22,260 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-15 05:42:22,261 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-15 05:42:22,261 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-15 05:42:22,261 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-15 05:42:22,261 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-15 05:42:22,262 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-15 05:42:22,262 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-15 05:42:22,262 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-15 05:42:22,262 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-15 05:42:22,263 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-15 05:42:22,263 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-15 05:42:22,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {17897#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:22,263 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-15 05:42:22,264 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-15 05:42:22,264 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-15 05:42:22,265 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-15 05:42:22,265 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-15 05:42:22,265 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-15 05:42:22,266 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-15 05:42:22,266 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-15 05:42:22,266 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-15 05:42:22,266 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-15 05:42:22,267 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-15 05:42:22,267 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-15 05:42:22,267 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-15 05:42:22,268 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-15 05:42:22,268 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-15 05:42:22,269 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-15 05:42:22,269 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-15 05:42:22,269 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-15 05:42:22,270 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-15 05:42:22,270 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-15 05:42:22,271 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-15 05:42:22,271 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-15 05:42:22,271 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-15 05:42:22,272 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-15 05:42:22,272 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-15 05:42:22,272 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-15 05:42:22,272 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-15 05:42:22,273 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-15 05:42:22,273 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-15 05:42:22,273 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-15 05:42:22,274 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-15 05:42:22,274 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-15 05:42:22,274 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-15 05:42:22,275 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-15 05:42:22,275 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-15 05:42:22,275 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-15 05:42:22,276 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-15 05:42:22,276 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-15 05:42:22,276 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-15 05:42:22,277 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-15 05:42:22,277 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-15 05:42:22,277 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-15 05:42:22,278 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-15 05:42:22,278 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-15 05:42:22,278 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-15 05:42:22,279 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-15 05:42:22,279 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-15 05:42:22,279 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-15 05:42:22,280 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-15 05:42:22,280 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-15 05:42:22,280 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-15 05:42:22,280 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-15 05:42:22,280 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-15 05:42:22,280 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-15 05:42:22,280 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-15 05:42:22,280 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-15 05:42:22,280 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-15 05:42:22,281 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-15 05:42:22,281 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-15 05:42:22,281 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-15 05:42:22,281 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-15 05:42:22,281 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-15 05:42:22,281 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-15 05:42:22,281 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-15 05:42:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:22,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662579409] [2022-04-15 05:42:22,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662579409] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:22,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757142725] [2022-04-15 05:42:22,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:22,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:22,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:22,283 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-15 05:42:22,283 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-15 05:42:22,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:22,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:22,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 05:42:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:22,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:23,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-15 05:42:23,123 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-15 05:42:23,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-15 05:42:23,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-15 05:42:23,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-15 05:42:23,125 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-15 05:42:23,125 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-15 05:42:23,126 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-15 05:42:23,126 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-15 05:42:23,126 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-15 05:42:23,126 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-15 05:42:23,127 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-15 05:42:23,127 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-15 05:42:23,127 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-15 05:42:23,127 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-15 05:42:23,128 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-15 05:42:23,128 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-15 05:42:23,128 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-15 05:42:23,128 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-15 05:42:23,129 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-15 05:42:23,129 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-15 05:42:23,129 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-15 05:42:23,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {17897#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:23,130 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-15 05:42:23,130 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-15 05:42:23,131 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-15 05:42:23,131 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-15 05:42:23,132 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-15 05:42:23,132 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-15 05:42:23,133 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-15 05:42:23,133 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-15 05:42:23,133 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-15 05:42:23,134 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-15 05:42:23,134 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-15 05:42:23,135 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-15 05:42:23,135 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-15 05:42:23,136 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-15 05:42:23,136 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-15 05:42:23,136 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-15 05:42:23,137 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-15 05:42:23,137 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-15 05:42:23,138 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-15 05:42:23,138 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-15 05:42:23,139 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-15 05:42:23,139 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-15 05:42:23,139 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-15 05:42:23,140 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-15 05:42:23,140 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-15 05:42:23,141 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-15 05:42:23,141 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-15 05:42:23,142 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-15 05:42:23,142 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-15 05:42:23,142 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-15 05:42:23,143 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-15 05:42:23,143 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-15 05:42:23,144 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-15 05:42:23,144 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-15 05:42:23,145 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-15 05:42:23,145 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-15 05:42:23,145 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-15 05:42:23,146 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-15 05:42:23,146 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-15 05:42:23,147 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-15 05:42:23,147 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-15 05:42:23,148 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-15 05:42:23,148 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-15 05:42:23,148 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-15 05:42:23,149 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-15 05:42:23,149 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-15 05:42:23,150 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-15 05:42:23,150 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-15 05:42:23,150 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-15 05:42:23,151 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-15 05:42:23,151 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-15 05:42:23,151 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-15 05:42:23,151 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-15 05:42:23,151 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-15 05:42:23,151 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-15 05:42:23,151 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-15 05:42:23,151 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-15 05:42:23,151 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-15 05:42:23,151 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-15 05:42:23,152 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-15 05:42:23,152 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-15 05:42:23,152 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-15 05:42:23,152 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-15 05:42:23,152 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-15 05:42:23,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:23,548 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-15 05:42:23,548 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-15 05:42:23,548 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-15 05:42:23,548 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-15 05:42:23,548 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-15 05:42:23,548 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-15 05:42:23,548 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-15 05:42:23,549 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-15 05:42:23,549 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-15 05:42:23,549 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-15 05:42:23,549 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-15 05:42:23,549 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-15 05:42:23,549 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-15 05:42:23,549 INFO L290 TraceCheckUtils]: 72: Hoare triple {18230#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17893#false} is VALID [2022-04-15 05:42:23,550 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-15 05:42:23,550 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-15 05:42:23,550 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-15 05:42:23,569 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-15 05:42:23,569 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-15 05:42:23,570 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-15 05:42:23,570 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-15 05:42:23,571 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-15 05:42:23,571 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-15 05:42:23,571 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-15 05:42:23,572 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-15 05:42:23,572 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-15 05:42:23,572 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-15 05:42:23,573 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-15 05:42:23,573 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-15 05:42:23,574 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-15 05:42:23,574 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-15 05:42:23,574 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-15 05:42:23,574 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-15 05:42:23,575 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-15 05:42:23,575 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-15 05:42:23,575 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-15 05:42:23,576 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-15 05:42:23,576 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-15 05:42:23,576 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-15 05:42:23,577 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-15 05:42:23,577 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-15 05:42:23,577 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-15 05:42:23,578 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-15 05:42:23,578 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-15 05:42:23,578 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-15 05:42:23,579 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-15 05:42:23,579 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-15 05:42:23,579 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-15 05:42:23,580 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-15 05:42:23,580 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-15 05:42:23,580 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-15 05:42:23,581 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-15 05:42:23,581 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-15 05:42:23,581 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-15 05:42:23,582 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-15 05:42:23,582 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-15 05:42:23,582 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-15 05:42:23,583 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-15 05:42:23,583 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-15 05:42:23,594 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-15 05:42:23,594 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-15 05:42:23,595 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-15 05:42:23,595 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-15 05:42:23,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {18380#(<= 17 main_~edgecount~0)} ~i~0 := 0; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-15 05:42:23,595 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-15 05:42:23,596 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-15 05:42:23,596 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-15 05:42:23,596 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-15 05:42:23,597 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-15 05:42:23,597 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-15 05:42:23,597 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-15 05:42:23,598 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-15 05:42:23,598 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-15 05:42:23,598 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-15 05:42:23,598 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-15 05:42:23,599 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-15 05:42:23,599 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-15 05:42:23,599 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-15 05:42:23,600 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-15 05:42:23,600 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-15 05:42:23,601 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-15 05:42:23,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-15 05:42:23,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-15 05:42:23,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-15 05:42:23,602 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-15 05:42:23,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-15 05:42:23,602 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-15 05:42:23,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757142725] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:23,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:23,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-04-15 05:42:23,603 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2091386390] [2022-04-15 05:42:23,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2091386390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:23,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:23,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 05:42:23,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397655233] [2022-04-15 05:42:23,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:23,609 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-15 05:42:23,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:23,610 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-15 05:42:23,669 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-15 05:42:23,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 05:42:23,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:23,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 05:42:23,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=1058, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 05:42:23,671 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-15 05:42:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,535 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2022-04-15 05:42:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 05:42:24,535 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-15 05:42:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:24,536 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-15 05:42:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 129 transitions. [2022-04-15 05:42:24,538 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-15 05:42:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 129 transitions. [2022-04-15 05:42:24,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 129 transitions. [2022-04-15 05:42:24,650 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-15 05:42:24,651 INFO L225 Difference]: With dead ends: 163 [2022-04-15 05:42:24,651 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 05:42:24,653 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-15 05:42:24,653 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-15 05:42:24,653 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-15 05:42:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 05:42:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-04-15 05:42:24,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:24,877 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-15 05:42:24,877 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-15 05:42:24,877 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-15 05:42:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,878 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-04-15 05:42:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-04-15 05:42:24,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:24,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:24,879 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-15 05:42:24,879 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-15 05:42:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,880 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-04-15 05:42:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-04-15 05:42:24,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:24,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:24,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:24,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:24,880 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-15 05:42:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-15 05:42:24,881 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 86 [2022-04-15 05:42:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:24,881 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-15 05:42:24,882 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-15 05:42:24,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-15 05:42:25,046 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-15 05:42:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 05:42:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 05:42:25,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:25,047 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-15 05:42:25,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:25,247 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-15 05:42:25,248 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 590969713, now seen corresponding path program 39 times [2022-04-15 05:42:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:25,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287679104] [2022-04-15 05:42:25,251 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:25,251 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:25,251 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash 590969713, now seen corresponding path program 40 times [2022-04-15 05:42:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:25,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612123440] [2022-04-15 05:42:25,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:25,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:25,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:25,560 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-15 05:42:25,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-15 05:42:25,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-15 05:42:25,561 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-15 05:42:25,561 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-15 05:42:25,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-15 05:42:25,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-15 05:42:25,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-15 05:42:25,563 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-15 05:42:25,563 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-15 05:42:25,564 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-15 05:42:25,564 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-15 05:42:25,564 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-15 05:42:25,564 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-15 05:42:25,565 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-15 05:42:25,565 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-15 05:42:25,565 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-15 05:42:25,566 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-15 05:42:25,566 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-15 05:42:25,566 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-15 05:42:25,566 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-15 05:42:25,567 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-15 05:42:25,567 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-15 05:42:25,567 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-15 05:42:25,567 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-15 05:42:25,568 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-15 05:42:25,568 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-15 05:42:25,569 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-15 05:42:25,569 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-15 05:42:25,570 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-15 05:42:25,570 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-15 05:42:25,571 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-15 05:42:25,571 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-15 05:42:25,572 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-15 05:42:25,572 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-15 05:42:25,572 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-15 05:42:25,573 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-15 05:42:25,573 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-15 05:42:25,574 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-15 05:42:25,574 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-15 05:42:25,575 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-15 05:42:25,575 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-15 05:42:25,576 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-15 05:42:25,576 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-15 05:42:25,577 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-15 05:42:25,577 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-15 05:42:25,578 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-15 05:42:25,578 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-15 05:42:25,579 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-15 05:42:25,579 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-15 05:42:25,580 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-15 05:42:25,580 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-15 05:42:25,581 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-15 05:42:25,581 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-15 05:42:25,582 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-15 05:42:25,582 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-15 05:42:25,582 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-15 05:42:25,595 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-15 05:42:25,596 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-15 05:42:25,597 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-15 05:42:25,597 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-15 05:42:25,597 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-15 05:42:25,598 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-15 05:42:25,598 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-15 05:42:25,599 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-15 05:42:25,599 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-15 05:42:25,600 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-15 05:42:25,600 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-15 05:42:25,601 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-15 05:42:25,601 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-15 05:42:25,601 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-15 05:42:25,602 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-15 05:42:25,602 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-15 05:42:25,603 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-15 05:42:25,603 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-15 05:42:25,604 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-15 05:42:25,604 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-15 05:42:25,605 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-15 05:42:25,605 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-15 05:42:25,605 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-15 05:42:25,605 INFO L290 TraceCheckUtils]: 77: Hoare triple {19195#false} assume !(~i~0 < ~nodecount~0); {19195#false} is VALID [2022-04-15 05:42:25,605 INFO L290 TraceCheckUtils]: 78: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-15 05:42:25,605 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-15 05:42:25,605 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-15 05:42:25,605 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-15 05:42:25,605 INFO L290 TraceCheckUtils]: 82: Hoare triple {19195#false} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-15 05:42:25,606 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-15 05:42:25,606 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-15 05:42:25,606 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-15 05:42:25,606 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-15 05:42:25,606 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-15 05:42:25,606 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-15 05:42:25,606 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-15 05:42:25,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:25,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612123440] [2022-04-15 05:42:25,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612123440] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:25,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222780322] [2022-04-15 05:42:25,607 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:25,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:25,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:25,608 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-15 05:42:25,615 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-15 05:42:25,776 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:25,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:25,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 05:42:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:25,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:26,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19194#true} is VALID [2022-04-15 05:42:26,348 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-15 05:42:26,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-15 05:42:26,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-15 05:42:26,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-15 05:42:26,349 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-15 05:42:26,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,349 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-15 05:42:26,349 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-15 05:42:26,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,349 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-15 05:42:26,349 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-15 05:42:26,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,349 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-15 05:42:26,349 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-15 05:42:26,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,349 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-15 05:42:26,350 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-15 05:42:26,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,350 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-15 05:42:26,350 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-15 05:42:26,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {19194#true} assume !(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {19194#true} ~i~0 := 0; {19194#true} is VALID [2022-04-15 05:42:26,350 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-15 05:42:26,351 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-15 05:42:26,351 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-15 05:42:26,351 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-15 05:42:26,352 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-15 05:42:26,352 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-15 05:42:26,352 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-15 05:42:26,352 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-15 05:42:26,353 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-15 05:42:26,353 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-15 05:42:26,353 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-15 05:42:26,354 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-15 05:42:26,354 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-15 05:42:26,354 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-15 05:42:26,355 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-15 05:42:26,355 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-15 05:42:26,355 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-15 05:42:26,356 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-15 05:42:26,356 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-15 05:42:26,356 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-15 05:42:26,357 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-15 05:42:26,357 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-15 05:42:26,357 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-15 05:42:26,358 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-15 05:42:26,358 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-15 05:42:26,358 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-15 05:42:26,358 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-15 05:42:26,359 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-15 05:42:26,359 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-15 05:42:26,359 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-15 05:42:26,360 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-15 05:42:26,360 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-15 05:42:26,360 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-15 05:42:26,361 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-15 05:42:26,361 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-15 05:42:26,361 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-15 05:42:26,362 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-15 05:42:26,362 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-15 05:42:26,362 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-15 05:42:26,363 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-15 05:42:26,363 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-15 05:42:26,363 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-15 05:42:26,364 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-15 05:42:26,364 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-15 05:42:26,364 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-15 05:42:26,365 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-15 05:42:26,365 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-15 05:42:26,365 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-15 05:42:26,365 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-15 05:42:26,366 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-15 05:42:26,366 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-15 05:42:26,367 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-15 05:42:26,367 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-15 05:42:26,367 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-15 05:42:26,368 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-15 05:42:26,368 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-15 05:42:26,368 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-15 05:42:26,369 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-15 05:42:26,369 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-15 05:42:26,370 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-15 05:42:26,370 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-15 05:42:26,370 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-15 05:42:26,370 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-15 05:42:26,370 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-15 05:42:26,370 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-15 05:42:26,370 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-15 05:42:26,370 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-15 05:42:26,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:26,906 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-15 05:42:26,906 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-15 05:42:26,906 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-15 05:42:26,906 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-15 05:42:26,906 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-15 05:42:26,906 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-15 05:42:26,906 INFO L290 TraceCheckUtils]: 82: Hoare triple {19524#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-15 05:42:26,907 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-15 05:42:26,907 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-15 05:42:26,908 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-15 05:42:26,908 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-15 05:42:26,908 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-15 05:42:26,908 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-15 05:42:26,909 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-15 05:42:26,909 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-15 05:42:26,909 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-15 05:42:26,910 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-15 05:42:26,910 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-15 05:42:26,911 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-15 05:42:26,911 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-15 05:42:26,911 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-15 05:42:26,912 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-15 05:42:26,912 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-15 05:42:26,912 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-15 05:42:26,913 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-15 05:42:26,913 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-15 05:42:26,914 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-15 05:42:26,914 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-15 05:42:26,914 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-15 05:42:26,915 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-15 05:42:26,915 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-15 05:42:26,915 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-15 05:42:26,916 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-15 05:42:26,916 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-15 05:42:26,916 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-15 05:42:26,917 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-15 05:42:26,917 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-15 05:42:26,917 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-15 05:42:26,918 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-15 05:42:26,918 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-15 05:42:26,918 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-15 05:42:26,919 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-15 05:42:26,919 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-15 05:42:26,919 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-15 05:42:26,920 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-15 05:42:26,920 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-15 05:42:26,921 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-15 05:42:26,921 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-15 05:42:26,921 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-15 05:42:26,922 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-15 05:42:26,922 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-15 05:42:26,922 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-15 05:42:26,923 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-15 05:42:26,923 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-15 05:42:26,923 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-15 05:42:26,923 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-15 05:42:26,924 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-15 05:42:26,924 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-15 05:42:26,924 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-15 05:42:26,925 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-15 05:42:26,925 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-15 05:42:26,926 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-15 05:42:26,926 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-15 05:42:26,926 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-15 05:42:26,927 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-15 05:42:26,927 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-15 05:42:26,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {19194#true} ~i~0 := 0; {19194#true} is VALID [2022-04-15 05:42:26,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {19194#true} assume !(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,927 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-15 05:42:26,927 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-15 05:42:26,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,928 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-15 05:42:26,928 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-15 05:42:26,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,928 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-15 05:42:26,928 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-15 05:42:26,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,928 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-15 05:42:26,928 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-15 05:42:26,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,928 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-15 05:42:26,928 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-15 05:42:26,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-15 05:42:26,928 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-15 05:42:26,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-15 05:42:26,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-15 05:42:26,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-15 05:42:26,929 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-15 05:42:26,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19194#true} is VALID [2022-04-15 05:42:26,929 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-15 05:42:26,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222780322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:26,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:26,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 60 [2022-04-15 05:42:26,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:26,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287679104] [2022-04-15 05:42:26,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287679104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:26,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:26,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 05:42:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695229182] [2022-04-15 05:42:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:26,930 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-15 05:42:26,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:26,931 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-15 05:42:26,988 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-15 05:42:26,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 05:42:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:26,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 05:42:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=849, Invalid=2691, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 05:42:26,989 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-15 05:42:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:28,150 INFO L93 Difference]: Finished difference Result 169 states and 214 transitions. [2022-04-15 05:42:28,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 05:42:28,151 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-15 05:42:28,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:28,151 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-15 05:42:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 133 transitions. [2022-04-15 05:42:28,155 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-15 05:42:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 133 transitions. [2022-04-15 05:42:28,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 133 transitions. [2022-04-15 05:42:28,271 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-15 05:42:28,272 INFO L225 Difference]: With dead ends: 169 [2022-04-15 05:42:28,272 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 05:42:28,274 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1321, Invalid=4841, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 05:42:28,274 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:28,274 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.3s Time] [2022-04-15 05:42:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 05:42:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-04-15 05:42:28,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:28,510 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-15 05:42:28,519 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-15 05:42:28,520 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-15 05:42:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:28,521 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-04-15 05:42:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-04-15 05:42:28,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:28,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:28,523 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-15 05:42:28,523 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-15 05:42:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:28,524 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-04-15 05:42:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-04-15 05:42:28,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:28,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:28,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:28,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:28,525 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-15 05:42:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2022-04-15 05:42:28,526 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 89 [2022-04-15 05:42:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:28,526 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2022-04-15 05:42:28,526 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-15 05:42:28,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 120 transitions. [2022-04-15 05:42:28,708 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-15 05:42:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2022-04-15 05:42:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 05:42:28,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:28,708 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-15 05:42:28,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:28,909 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-15 05:42:28,909 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:28,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash 576720250, now seen corresponding path program 41 times [2022-04-15 05:42:28,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:28,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1977801642] [2022-04-15 05:42:28,912 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:28,912 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:28,912 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 576720250, now seen corresponding path program 42 times [2022-04-15 05:42:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:28,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177309613] [2022-04-15 05:42:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:28,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:29,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:29,203 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-15 05:42:29,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-15 05:42:29,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-15 05:42:29,204 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-15 05:42:29,204 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-15 05:42:29,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-15 05:42:29,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-15 05:42:29,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-15 05:42:29,209 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-15 05:42:29,210 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-15 05:42:29,210 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-15 05:42:29,210 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-15 05:42:29,210 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-15 05:42:29,211 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-15 05:42:29,211 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-15 05:42:29,211 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-15 05:42:29,211 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-15 05:42:29,212 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-15 05:42:29,212 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-15 05:42:29,212 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-15 05:42:29,212 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-15 05:42:29,213 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-15 05:42:29,213 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-15 05:42:29,213 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-15 05:42:29,213 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-15 05:42:29,214 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-15 05:42:29,214 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-15 05:42:29,214 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-15 05:42:29,215 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-15 05:42:29,215 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-15 05:42:29,216 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-15 05:42:29,216 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-15 05:42:29,216 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-15 05:42:29,217 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-15 05:42:29,217 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-15 05:42:29,218 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-15 05:42:29,218 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-15 05:42:29,219 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-15 05:42:29,219 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-15 05:42:29,219 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-15 05:42:29,220 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-15 05:42:29,220 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-15 05:42:29,221 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-15 05:42:29,221 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-15 05:42:29,221 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-15 05:42:29,222 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-15 05:42:29,222 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-15 05:42:29,223 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-15 05:42:29,223 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-15 05:42:29,223 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-15 05:42:29,224 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-15 05:42:29,224 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-15 05:42:29,225 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-15 05:42:29,225 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-15 05:42:29,226 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-15 05:42:29,226 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-15 05:42:29,226 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-15 05:42:29,227 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-15 05:42:29,227 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-15 05:42:29,228 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-15 05:42:29,228 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-15 05:42:29,228 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-15 05:42:29,229 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-15 05:42:29,229 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-15 05:42:29,230 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-15 05:42:29,230 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-15 05:42:29,230 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-15 05:42:29,231 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-15 05:42:29,231 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-15 05:42:29,232 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-15 05:42:29,232 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-15 05:42:29,232 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-15 05:42:29,233 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-15 05:42:29,233 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-15 05:42:29,234 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-15 05:42:29,234 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-15 05:42:29,235 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-15 05:42:29,235 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-15 05:42:29,235 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-15 05:42:29,236 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-15 05:42:29,236 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-15 05:42:29,237 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-15 05:42:29,237 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-15 05:42:29,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {20559#false} assume !(~i~0 < ~nodecount~0); {20559#false} is VALID [2022-04-15 05:42:29,237 INFO L290 TraceCheckUtils]: 81: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-15 05:42:29,237 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-15 05:42:29,237 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-15 05:42:29,237 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-15 05:42:29,237 INFO L290 TraceCheckUtils]: 85: Hoare triple {20559#false} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-15 05:42:29,237 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-15 05:42:29,237 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-15 05:42:29,237 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-15 05:42:29,237 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-15 05:42:29,237 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-15 05:42:29,237 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-15 05:42:29,238 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-15 05:42:29,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:29,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177309613] [2022-04-15 05:42:29,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177309613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:29,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563578387] [2022-04-15 05:42:29,238 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:29,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:29,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:29,239 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-15 05:42:29,240 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-15 05:42:29,382 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:42:29,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:29,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:42:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:29,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:29,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20558#true} is VALID [2022-04-15 05:42:29,695 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-15 05:42:29,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-15 05:42:29,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-15 05:42:29,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-15 05:42:29,697 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-15 05:42:29,697 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-15 05:42:29,698 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-15 05:42:29,698 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-15 05:42:29,698 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-15 05:42:29,698 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-15 05:42:29,699 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-15 05:42:29,699 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-15 05:42:29,699 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-15 05:42:29,699 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-15 05:42:29,700 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-15 05:42:29,700 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-15 05:42:29,700 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-15 05:42:29,700 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-15 05:42:29,701 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-15 05:42:29,701 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-15 05:42:29,701 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-15 05:42:29,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {20602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:29,702 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-15 05:42:29,702 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-15 05:42:29,702 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-15 05:42:29,702 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-15 05:42:29,703 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-15 05:42:29,703 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-15 05:42:29,703 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-15 05:42:29,703 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-15 05:42:29,704 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-15 05:42:29,704 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-15 05:42:29,704 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-15 05:42:29,707 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-15 05:42:29,707 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-15 05:42:29,707 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-15 05:42:29,708 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-15 05:42:29,708 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-15 05:42:29,708 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-15 05:42:29,708 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-15 05:42:29,709 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-15 05:42:29,709 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-15 05:42:29,709 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-15 05:42:29,709 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-15 05:42:29,710 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-15 05:42:29,710 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-15 05:42:29,710 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-15 05:42:29,710 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-15 05:42:29,711 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-15 05:42:29,711 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-15 05:42:29,711 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-15 05:42:29,711 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-15 05:42:29,712 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-15 05:42:29,712 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-15 05:42:29,712 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-15 05:42:29,712 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-15 05:42:29,713 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-15 05:42:29,713 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-15 05:42:29,713 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-15 05:42:29,713 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-15 05:42:29,714 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-15 05:42:29,714 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-15 05:42:29,714 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-15 05:42:29,714 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-15 05:42:29,715 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-15 05:42:29,715 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-15 05:42:29,715 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-15 05:42:29,715 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-15 05:42:29,716 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-15 05:42:29,716 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-15 05:42:29,716 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-15 05:42:29,716 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-15 05:42:29,717 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-15 05:42:29,717 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-15 05:42:29,717 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-15 05:42:29,717 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-15 05:42:29,718 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-15 05:42:29,718 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-15 05:42:29,718 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-15 05:42:29,718 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-15 05:42:29,719 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-15 05:42:29,719 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-15 05:42:29,720 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-15 05:42:29,720 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-15 05:42:29,720 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-15 05:42:29,721 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-15 05:42:29,721 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-15 05:42:29,721 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-15 05:42:29,721 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-15 05:42:29,721 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-15 05:42:29,721 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-15 05:42:29,721 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-15 05:42:29,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:29,991 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-15 05:42:29,991 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-15 05:42:29,991 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-15 05:42:29,991 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-15 05:42:29,991 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-15 05:42:29,991 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-15 05:42:29,991 INFO L290 TraceCheckUtils]: 85: Hoare triple {20881#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-15 05:42:29,992 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-15 05:42:29,992 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-15 05:42:29,992 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-15 05:42:29,993 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-15 05:42:29,993 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-15 05:42:29,993 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-15 05:42:29,993 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-15 05:42:29,994 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-15 05:42:29,994 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-15 05:42:29,994 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-15 05:42:29,995 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-15 05:42:29,995 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-15 05:42:29,995 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-15 05:42:29,995 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-15 05:42:29,996 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-15 05:42:29,996 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-15 05:42:29,996 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-15 05:42:29,996 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-15 05:42:29,997 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-15 05:42:29,997 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-15 05:42:29,997 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-15 05:42:29,997 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-15 05:42:29,998 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-15 05:42:29,998 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-15 05:42:29,998 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-15 05:42:29,998 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-15 05:42:29,999 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-15 05:42:29,999 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-15 05:42:29,999 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-15 05:42:30,000 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-15 05:42:30,000 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-15 05:42:30,000 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-15 05:42:30,000 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-15 05:42:30,001 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-15 05:42:30,001 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-15 05:42:30,001 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-15 05:42:30,002 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-15 05:42:30,002 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-15 05:42:30,002 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-15 05:42:30,003 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-15 05:42:30,003 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-15 05:42:30,003 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-15 05:42:30,003 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-15 05:42:30,008 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-15 05:42:30,008 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-15 05:42:30,008 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-15 05:42:30,009 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-15 05:42:30,009 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-15 05:42:30,009 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-15 05:42:30,009 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-15 05:42:30,010 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-15 05:42:30,010 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-15 05:42:30,010 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-15 05:42:30,010 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-15 05:42:30,011 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-15 05:42:30,011 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-15 05:42:30,011 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-15 05:42:30,011 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-15 05:42:30,012 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-15 05:42:30,012 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-15 05:42:30,012 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-15 05:42:30,013 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-15 05:42:30,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {20895#(< 1 main_~edgecount~0)} ~i~0 := 0; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-15 05:42:30,013 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-15 05:42:30,013 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-15 05:42:30,014 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-15 05:42:30,014 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-15 05:42:30,014 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-15 05:42:30,014 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-15 05:42:30,015 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-15 05:42:30,015 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-15 05:42:30,015 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-15 05:42:30,015 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-15 05:42:30,016 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-15 05:42:30,016 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-15 05:42:30,016 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-15 05:42:30,016 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-15 05:42:30,017 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-15 05:42:30,017 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-15 05:42:30,019 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-15 05:42:30,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-15 05:42:30,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-15 05:42:30,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-15 05:42:30,019 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-15 05:42:30,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20558#true} is VALID [2022-04-15 05:42:30,019 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-15 05:42:30,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563578387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:30,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:30,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 5] total 29 [2022-04-15 05:42:30,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:30,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1977801642] [2022-04-15 05:42:30,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1977801642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:30,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:30,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 05:42:30,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331601122] [2022-04-15 05:42:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:30,021 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-15 05:42:30,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:30,021 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-15 05:42:30,090 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-15 05:42:30,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 05:42:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:30,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 05:42:30,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=516, Unknown=0, NotChecked=0, Total=812 [2022-04-15 05:42:30,091 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-15 05:42:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:30,979 INFO L93 Difference]: Finished difference Result 175 states and 222 transitions. [2022-04-15 05:42:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 05:42:30,980 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-15 05:42:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:30,980 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-15 05:42:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2022-04-15 05:42:30,981 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-15 05:42:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2022-04-15 05:42:30,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 137 transitions. [2022-04-15 05:42:31,099 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-15 05:42:31,101 INFO L225 Difference]: With dead ends: 175 [2022-04-15 05:42:31,101 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 05:42:31,102 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-15 05:42:31,102 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-15 05:42:31,102 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-15 05:42:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 05:42:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2022-04-15 05:42:31,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:31,384 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-15 05:42:31,384 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-15 05:42:31,384 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-15 05:42:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:31,400 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-04-15 05:42:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2022-04-15 05:42:31,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:31,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:31,401 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-15 05:42:31,401 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-15 05:42:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:31,402 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-04-15 05:42:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2022-04-15 05:42:31,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:31,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:31,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:31,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:31,402 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-15 05:42:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2022-04-15 05:42:31,403 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 92 [2022-04-15 05:42:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:31,403 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2022-04-15 05:42:31,404 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-15 05:42:31,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 124 transitions. [2022-04-15 05:42:31,611 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-15 05:42:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-15 05:42:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 05:42:31,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:31,612 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-15 05:42:31,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 05:42:31,812 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-15 05:42:31,813 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1272730321, now seen corresponding path program 43 times [2022-04-15 05:42:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:31,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [256563204] [2022-04-15 05:42:31,816 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:31,816 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:31,816 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1272730321, now seen corresponding path program 44 times [2022-04-15 05:42:31,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:31,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194480077] [2022-04-15 05:42:31,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:31,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:32,145 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-15 05:42:32,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-15 05:42:32,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-15 05:42:32,145 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-15 05:42:32,145 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-15 05:42:32,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-15 05:42:32,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-15 05:42:32,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-15 05:42:32,147 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-15 05:42:32,148 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-15 05:42:32,148 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-15 05:42:32,148 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-15 05:42:32,148 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-15 05:42:32,148 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-15 05:42:32,149 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-15 05:42:32,149 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-15 05:42:32,149 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-15 05:42:32,149 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-15 05:42:32,150 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-15 05:42:32,150 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-15 05:42:32,150 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-15 05:42:32,150 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-15 05:42:32,151 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-15 05:42:32,151 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-15 05:42:32,151 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-15 05:42:32,151 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-15 05:42:32,152 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-15 05:42:32,152 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-15 05:42:32,152 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-15 05:42:32,153 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-15 05:42:32,153 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-15 05:42:32,154 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-15 05:42:32,154 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-15 05:42:32,154 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-15 05:42:32,155 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-15 05:42:32,155 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-15 05:42:32,156 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-15 05:42:32,156 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-15 05:42:32,156 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-15 05:42:32,157 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-15 05:42:32,157 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-15 05:42:32,158 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-15 05:42:32,158 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-15 05:42:32,158 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-15 05:42:32,159 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-15 05:42:32,159 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-15 05:42:32,160 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-15 05:42:32,160 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-15 05:42:32,161 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-15 05:42:32,161 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-15 05:42:32,161 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-15 05:42:32,162 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-15 05:42:32,162 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-15 05:42:32,162 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-15 05:42:32,163 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-15 05:42:32,163 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-15 05:42:32,164 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-15 05:42:32,164 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-15 05:42:32,164 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-15 05:42:32,165 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-15 05:42:32,165 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-15 05:42:32,166 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-15 05:42:32,166 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-15 05:42:32,167 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-15 05:42:32,167 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-15 05:42:32,167 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-15 05:42:32,168 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-15 05:42:32,168 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-15 05:42:32,168 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-15 05:42:32,169 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-15 05:42:32,169 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-15 05:42:32,170 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-15 05:42:32,170 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-15 05:42:32,170 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-15 05:42:32,171 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-15 05:42:32,171 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-15 05:42:32,172 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-15 05:42:32,172 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-15 05:42:32,173 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-15 05:42:32,173 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-15 05:42:32,173 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-15 05:42:32,174 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-15 05:42:32,174 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-15 05:42:32,175 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-15 05:42:32,175 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-15 05:42:32,175 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-15 05:42:32,175 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-15 05:42:32,175 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-15 05:42:32,175 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-15 05:42:32,175 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-15 05:42:32,175 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-15 05:42:32,176 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-15 05:42:32,176 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-15 05:42:32,176 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-15 05:42:32,176 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-15 05:42:32,176 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-15 05:42:32,176 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-15 05:42:32,176 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-15 05:42:32,177 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-15 05:42:32,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:32,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194480077] [2022-04-15 05:42:32,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194480077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:32,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144429374] [2022-04-15 05:42:32,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:32,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:32,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:32,200 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-15 05:42:32,231 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-15 05:42:32,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:32,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:32,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 05:42:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:32,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:33,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21935#true} is VALID [2022-04-15 05:42:33,295 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-15 05:42:33,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-15 05:42:33,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-15 05:42:33,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-15 05:42:33,297 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-15 05:42:33,297 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-15 05:42:33,297 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-15 05:42:33,298 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-15 05:42:33,298 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-15 05:42:33,298 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-15 05:42:33,298 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-15 05:42:33,299 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-15 05:42:33,299 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-15 05:42:33,299 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-15 05:42:33,299 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-15 05:42:33,300 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-15 05:42:33,300 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-15 05:42:33,300 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-15 05:42:33,300 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-15 05:42:33,301 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-15 05:42:33,301 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-15 05:42:33,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {21980#(<= 20 main_~edgecount~0)} ~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:33,302 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-15 05:42:33,302 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-15 05:42:33,302 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-15 05:42:33,303 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-15 05:42:33,303 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-15 05:42:33,304 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-15 05:42:33,304 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-15 05:42:33,304 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-15 05:42:33,305 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-15 05:42:33,305 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-15 05:42:33,306 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-15 05:42:33,306 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-15 05:42:33,306 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-15 05:42:33,307 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-15 05:42:33,307 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-15 05:42:33,308 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-15 05:42:33,308 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-15 05:42:33,309 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-15 05:42:33,309 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-15 05:42:33,309 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-15 05:42:33,310 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-15 05:42:33,310 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-15 05:42:33,311 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-15 05:42:33,311 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-15 05:42:33,311 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-15 05:42:33,312 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-15 05:42:33,312 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-15 05:42:33,313 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-15 05:42:33,313 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-15 05:42:33,313 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-15 05:42:33,314 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-15 05:42:33,314 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-15 05:42:33,315 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-15 05:42:33,315 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-15 05:42:33,316 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-15 05:42:33,316 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-15 05:42:33,316 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-15 05:42:33,317 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-15 05:42:33,317 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-15 05:42:33,318 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-15 05:42:33,318 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-15 05:42:33,318 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-15 05:42:33,319 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-15 05:42:33,319 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-15 05:42:33,320 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-15 05:42:33,320 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-15 05:42:33,320 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-15 05:42:33,321 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-15 05:42:33,321 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-15 05:42:33,322 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-15 05:42:33,322 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-15 05:42:33,322 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-15 05:42:33,323 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-15 05:42:33,323 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-15 05:42:33,324 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-15 05:42:33,324 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-15 05:42:33,325 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-15 05:42:33,325 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-15 05:42:33,325 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-15 05:42:33,325 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-15 05:42:33,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-15 05:42:33,326 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-15 05:42:33,326 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-15 05:42:33,326 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-15 05:42:33,326 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-15 05:42:33,326 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-15 05:42:33,326 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-15 05:42:33,326 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-15 05:42:33,326 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-15 05:42:33,326 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-15 05:42:33,326 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-15 05:42:33,326 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-15 05:42:33,327 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-15 05:42:33,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:33,955 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-15 05:42:33,955 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-15 05:42:33,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-15 05:42:33,955 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-15 05:42:33,956 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-15 05:42:33,956 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-15 05:42:33,956 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-15 05:42:33,956 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-15 05:42:33,956 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-15 05:42:33,956 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-15 05:42:33,956 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-15 05:42:33,956 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-15 05:42:33,956 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-15 05:42:33,956 INFO L290 TraceCheckUtils]: 81: Hoare triple {22307#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {21936#false} is VALID [2022-04-15 05:42:33,957 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-15 05:42:33,957 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-15 05:42:33,957 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-15 05:42:33,958 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-15 05:42:33,958 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-15 05:42:33,959 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-15 05:42:33,959 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-15 05:42:33,959 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-15 05:42:33,960 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-15 05:42:33,960 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-15 05:42:33,960 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-15 05:42:33,961 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-15 05:42:33,961 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-15 05:42:33,961 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-15 05:42:33,962 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-15 05:42:33,962 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-15 05:42:33,962 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-15 05:42:33,963 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-15 05:42:33,963 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-15 05:42:33,963 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-15 05:42:33,964 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-15 05:42:33,964 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-15 05:42:33,964 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-15 05:42:33,965 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-15 05:42:33,965 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-15 05:42:33,965 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-15 05:42:33,966 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-15 05:42:33,966 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-15 05:42:33,966 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-15 05:42:33,967 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-15 05:42:33,967 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-15 05:42:33,967 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-15 05:42:33,968 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-15 05:42:33,968 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-15 05:42:33,968 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-15 05:42:33,968 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-15 05:42:33,969 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-15 05:42:33,969 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-15 05:42:33,969 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-15 05:42:33,970 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-15 05:42:33,970 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-15 05:42:33,970 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-15 05:42:33,971 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-15 05:42:33,971 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-15 05:42:33,972 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-15 05:42:33,972 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-15 05:42:33,972 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-15 05:42:33,973 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-15 05:42:33,973 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-15 05:42:33,973 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-15 05:42:33,974 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-15 05:42:33,974 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-15 05:42:33,974 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-15 05:42:33,975 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-15 05:42:33,975 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-15 05:42:33,975 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-15 05:42:33,975 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-15 05:42:33,976 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-15 05:42:33,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {21980#(<= 20 main_~edgecount~0)} ~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:33,976 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-15 05:42:33,977 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-15 05:42:33,977 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-15 05:42:33,977 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-15 05:42:33,977 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-15 05:42:33,978 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-15 05:42:33,978 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-15 05:42:33,978 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-15 05:42:33,978 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-15 05:42:33,979 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-15 05:42:33,979 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-15 05:42:33,979 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-15 05:42:33,979 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-15 05:42:33,980 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-15 05:42:33,980 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-15 05:42:33,980 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-15 05:42:33,982 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-15 05:42:33,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-15 05:42:33,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-15 05:42:33,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-15 05:42:33,982 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-15 05:42:33,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21935#true} is VALID [2022-04-15 05:42:33,983 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-15 05:42:33,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144429374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:33,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:33,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 65 [2022-04-15 05:42:33,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:33,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [256563204] [2022-04-15 05:42:33,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [256563204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:33,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:33,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 05:42:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387497984] [2022-04-15 05:42:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:33,984 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-15 05:42:33,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:33,984 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-15 05:42:34,039 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-15 05:42:34,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 05:42:34,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:34,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 05:42:34,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=2772, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 05:42:34,041 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-15 05:42:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:35,068 INFO L93 Difference]: Finished difference Result 179 states and 227 transitions. [2022-04-15 05:42:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 05:42:35,068 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-15 05:42:35,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:35,069 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-15 05:42:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-15 05:42:35,070 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-15 05:42:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-15 05:42:35,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 138 transitions. [2022-04-15 05:42:35,178 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-15 05:42:35,179 INFO L225 Difference]: With dead ends: 179 [2022-04-15 05:42:35,179 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 05:42:35,180 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-15 05:42:35,181 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-15 05:42:35,181 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-15 05:42:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 05:42:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-15 05:42:35,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:35,419 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-15 05:42:35,419 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-15 05:42:35,419 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-15 05:42:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:35,420 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-15 05:42:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-15 05:42:35,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:35,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:35,421 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-15 05:42:35,421 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-15 05:42:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:35,422 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-15 05:42:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-15 05:42:35,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:35,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:35,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:35,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:35,422 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-15 05:42:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2022-04-15 05:42:35,423 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 95 [2022-04-15 05:42:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:35,424 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2022-04-15 05:42:35,424 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-15 05:42:35,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 128 transitions. [2022-04-15 05:42:35,627 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-15 05:42:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-15 05:42:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 05:42:35,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:35,628 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-15 05:42:35,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-15 05:42:35,841 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-15 05:42:35,841 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 6650394, now seen corresponding path program 45 times [2022-04-15 05:42:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:35,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105143253] [2022-04-15 05:42:35,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:35,844 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:35,844 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash 6650394, now seen corresponding path program 46 times [2022-04-15 05:42:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:35,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066372726] [2022-04-15 05:42:35,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:35,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:35,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:35,933 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-15 05:42:35,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-15 05:42:35,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-15 05:42:35,934 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-15 05:42:35,934 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-15 05:42:35,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-15 05:42:35,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-15 05:42:35,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-15 05:42:35,936 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-15 05:42:35,936 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-15 05:42:35,936 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-15 05:42:35,936 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-15 05:42:35,937 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-15 05:42:35,937 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-15 05:42:35,937 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-15 05:42:35,937 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-15 05:42:35,937 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-15 05:42:35,938 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-15 05:42:35,938 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-15 05:42:35,938 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-15 05:42:35,938 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-15 05:42:35,939 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-15 05:42:35,939 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-15 05:42:35,939 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-15 05:42:35,939 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-15 05:42:35,939 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-15 05:42:35,940 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-15 05:42:35,940 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-15 05:42:35,941 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-15 05:42:35,941 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-15 05:42:35,941 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-15 05:42:35,942 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-15 05:42:35,942 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-15 05:42:35,942 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-15 05:42:35,943 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-15 05:42:35,943 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-15 05:42:35,944 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-15 05:42:35,944 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-15 05:42:35,944 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-15 05:42:35,945 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-15 05:42:35,945 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-15 05:42:35,945 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-15 05:42:35,946 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-15 05:42:35,946 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-15 05:42:35,946 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-15 05:42:35,947 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-15 05:42:35,947 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-15 05:42:35,948 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-15 05:42:35,948 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-15 05:42:35,948 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-15 05:42:35,949 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-15 05:42:35,949 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-15 05:42:35,949 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-15 05:42:35,950 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-15 05:42:35,950 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-15 05:42:35,950 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-15 05:42:35,951 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-15 05:42:35,951 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-15 05:42:35,952 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-15 05:42:35,952 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-15 05:42:35,952 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-15 05:42:35,953 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-15 05:42:35,953 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-15 05:42:35,953 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-15 05:42:35,954 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-15 05:42:35,954 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-15 05:42:35,954 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-15 05:42:35,955 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-15 05:42:35,955 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-15 05:42:35,955 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-15 05:42:35,956 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-15 05:42:35,956 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-15 05:42:35,957 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-15 05:42:35,957 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-15 05:42:35,957 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-15 05:42:35,958 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-15 05:42:35,958 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-15 05:42:35,958 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-15 05:42:35,959 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-15 05:42:35,959 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-15 05:42:35,959 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-15 05:42:35,960 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-15 05:42:35,960 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-15 05:42:35,960 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-15 05:42:35,961 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-15 05:42:35,961 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-15 05:42:35,961 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-15 05:42:35,962 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-15 05:42:35,962 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-15 05:42:35,962 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-15 05:42:35,962 INFO L290 TraceCheckUtils]: 87: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-15 05:42:35,963 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-15 05:42:35,963 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-15 05:42:35,963 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-15 05:42:35,963 INFO L290 TraceCheckUtils]: 91: Hoare triple {23385#false} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-15 05:42:35,963 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-15 05:42:35,963 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-15 05:42:35,963 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-15 05:42:35,963 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-15 05:42:35,963 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-15 05:42:35,963 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-15 05:42:35,964 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-15 05:42:35,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:35,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066372726] [2022-04-15 05:42:35,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066372726] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:35,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114222240] [2022-04-15 05:42:35,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:35,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:35,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:35,965 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-15 05:42:35,980 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-15 05:42:36,149 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:36,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:36,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 05:42:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:36,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:36,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23384#true} is VALID [2022-04-15 05:42:36,784 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-15 05:42:36,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-15 05:42:36,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-15 05:42:36,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-15 05:42:36,785 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-15 05:42:36,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:36,785 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-15 05:42:36,785 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-15 05:42:36,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:36,785 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-15 05:42:36,785 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-15 05:42:36,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:36,785 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-15 05:42:36,785 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-15 05:42:36,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:36,786 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-15 05:42:36,786 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-15 05:42:36,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:36,786 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-15 05:42:36,786 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-15 05:42:36,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {23384#true} assume !(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:36,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {23384#true} ~i~0 := 0; {23384#true} is VALID [2022-04-15 05:42:36,786 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-15 05:42:36,787 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-15 05:42:36,787 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-15 05:42:36,787 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-15 05:42:36,787 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-15 05:42:36,788 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-15 05:42:36,788 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-15 05:42:36,788 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-15 05:42:36,789 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-15 05:42:36,789 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-15 05:42:36,789 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-15 05:42:36,789 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-15 05:42:36,790 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-15 05:42:36,790 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-15 05:42:36,790 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-15 05:42:36,791 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-15 05:42:36,791 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-15 05:42:36,791 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-15 05:42:36,791 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-15 05:42:36,792 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-15 05:42:36,792 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-15 05:42:36,792 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-15 05:42:36,793 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-15 05:42:36,793 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-15 05:42:36,793 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-15 05:42:36,793 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-15 05:42:36,794 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-15 05:42:36,794 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-15 05:42:36,794 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-15 05:42:36,795 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-15 05:42:36,795 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-15 05:42:36,795 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-15 05:42:36,795 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-15 05:42:36,796 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-15 05:42:36,796 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-15 05:42:36,796 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-15 05:42:36,797 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-15 05:42:36,797 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-15 05:42:36,797 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-15 05:42:36,797 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-15 05:42:36,798 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-15 05:42:36,798 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-15 05:42:36,798 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-15 05:42:36,799 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-15 05:42:36,799 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-15 05:42:36,799 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-15 05:42:36,799 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-15 05:42:36,800 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-15 05:42:36,800 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-15 05:42:36,800 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-15 05:42:36,801 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-15 05:42:36,801 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-15 05:42:36,801 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-15 05:42:36,802 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-15 05:42:36,802 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-15 05:42:36,803 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-15 05:42:36,804 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-15 05:42:36,804 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-15 05:42:36,805 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-15 05:42:36,805 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-15 05:42:36,805 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-15 05:42:36,805 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-15 05:42:36,806 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-15 05:42:36,806 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-15 05:42:36,806 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-15 05:42:36,807 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-15 05:42:36,807 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-15 05:42:36,808 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-15 05:42:36,808 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-15 05:42:36,808 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-15 05:42:36,808 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-15 05:42:36,808 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-15 05:42:36,808 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-15 05:42:36,808 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-15 05:42:36,809 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-15 05:42:36,809 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-15 05:42:36,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:37,424 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-15 05:42:37,424 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-15 05:42:37,424 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-15 05:42:37,424 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-15 05:42:37,424 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-15 05:42:37,424 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-15 05:42:37,425 INFO L290 TraceCheckUtils]: 91: Hoare triple {23728#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-15 05:42:37,425 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-15 05:42:37,425 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-15 05:42:37,426 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-15 05:42:37,426 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-15 05:42:37,426 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-15 05:42:37,426 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-15 05:42:37,427 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-15 05:42:37,427 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-15 05:42:37,427 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-15 05:42:37,428 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-15 05:42:37,428 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-15 05:42:37,428 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-15 05:42:37,429 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-15 05:42:37,429 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-15 05:42:37,429 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-15 05:42:37,429 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-15 05:42:37,430 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-15 05:42:37,430 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-15 05:42:37,431 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-15 05:42:37,431 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-15 05:42:37,431 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-15 05:42:37,432 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-15 05:42:37,432 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-15 05:42:37,432 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-15 05:42:37,433 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-15 05:42:37,433 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-15 05:42:37,433 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-15 05:42:37,434 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-15 05:42:37,434 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-15 05:42:37,434 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-15 05:42:37,435 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-15 05:42:37,435 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-15 05:42:37,435 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-15 05:42:37,435 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-15 05:42:37,436 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-15 05:42:37,436 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-15 05:42:37,436 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-15 05:42:37,437 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-15 05:42:37,437 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-15 05:42:37,438 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-15 05:42:37,438 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-15 05:42:37,438 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-15 05:42:37,438 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-15 05:42:37,439 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-15 05:42:37,439 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-15 05:42:37,439 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-15 05:42:37,440 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-15 05:42:37,440 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-15 05:42:37,440 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-15 05:42:37,440 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-15 05:42:37,441 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-15 05:42:37,441 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-15 05:42:37,441 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-15 05:42:37,442 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-15 05:42:37,442 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-15 05:42:37,442 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-15 05:42:37,443 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-15 05:42:37,443 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-15 05:42:37,444 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-15 05:42:37,444 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-15 05:42:37,444 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-15 05:42:37,445 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-15 05:42:37,445 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-15 05:42:37,445 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-15 05:42:37,446 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-15 05:42:37,446 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-15 05:42:37,446 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-15 05:42:37,446 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-15 05:42:37,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {23384#true} ~i~0 := 0; {23384#true} is VALID [2022-04-15 05:42:37,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {23384#true} assume !(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:37,447 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-15 05:42:37,447 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-15 05:42:37,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:37,447 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-15 05:42:37,447 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-15 05:42:37,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:37,447 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-15 05:42:37,447 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-15 05:42:37,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:37,447 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-15 05:42:37,447 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-15 05:42:37,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:37,447 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-15 05:42:37,448 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-15 05:42:37,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-15 05:42:37,448 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-15 05:42:37,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-15 05:42:37,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-15 05:42:37,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-15 05:42:37,448 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-15 05:42:37,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23384#true} is VALID [2022-04-15 05:42:37,448 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-15 05:42:37,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114222240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:37,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:37,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 25, 25] total 50 [2022-04-15 05:42:37,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:37,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105143253] [2022-04-15 05:42:37,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105143253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:37,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:37,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:42:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978761678] [2022-04-15 05:42:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:37,450 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-15 05:42:37,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:37,450 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-15 05:42:37,468 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-15 05:42:37,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:42:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:37,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:42:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=1636, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 05:42:37,469 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-15 05:42:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:38,436 INFO L93 Difference]: Finished difference Result 258 states and 330 transitions. [2022-04-15 05:42:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:42:38,436 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-15 05:42:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:38,436 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-15 05:42:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-15 05:42:38,437 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-15 05:42:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-15 05:42:38,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2022-04-15 05:42:38,529 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-15 05:42:38,534 INFO L225 Difference]: With dead ends: 258 [2022-04-15 05:42:38,534 INFO L226 Difference]: Without dead ends: 242 [2022-04-15 05:42:38,535 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-15 05:42:38,535 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-15 05:42:38,536 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-15 05:42:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-15 05:42:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 166. [2022-04-15 05:42:39,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:39,134 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-15 05:42:39,134 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-15 05:42:39,134 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-15 05:42:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:39,138 INFO L93 Difference]: Finished difference Result 242 states and 312 transitions. [2022-04-15 05:42:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 312 transitions. [2022-04-15 05:42:39,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:39,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:39,139 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-15 05:42:39,139 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-15 05:42:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:39,143 INFO L93 Difference]: Finished difference Result 242 states and 312 transitions. [2022-04-15 05:42:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 312 transitions. [2022-04-15 05:42:39,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:39,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:39,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:39,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:39,144 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-15 05:42:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2022-04-15 05:42:39,147 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 98 [2022-04-15 05:42:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:39,147 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2022-04-15 05:42:39,147 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-15 05:42:39,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 212 transitions. [2022-04-15 05:42:39,479 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-15 05:42:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2022-04-15 05:42:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-15 05:42:39,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:39,480 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-15 05:42:39,498 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-15 05:42:39,681 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-15 05:42:39,681 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:39,681 INFO L85 PathProgramCache]: Analyzing trace with hash 576417944, now seen corresponding path program 47 times [2022-04-15 05:42:39,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:39,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [204648485] [2022-04-15 05:42:39,684 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:39,684 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:39,684 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash 576417944, now seen corresponding path program 48 times [2022-04-15 05:42:39,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:39,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395664217] [2022-04-15 05:42:39,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:39,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:39,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:39,849 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-15 05:42:39,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-15 05:42:39,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-15 05:42:39,850 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-15 05:42:39,850 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-15 05:42:39,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-15 05:42:39,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-15 05:42:39,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-15 05:42:39,851 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-15 05:42:39,852 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-15 05:42:39,852 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-15 05:42:39,852 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-15 05:42:39,852 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-15 05:42:39,852 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-15 05:42:39,853 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-15 05:42:39,853 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-15 05:42:39,853 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-15 05:42:39,853 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-15 05:42:39,854 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-15 05:42:39,854 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-15 05:42:39,854 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-15 05:42:39,854 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-15 05:42:39,854 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-15 05:42:39,855 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-15 05:42:39,855 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-15 05:42:39,855 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-15 05:42:39,855 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-15 05:42:39,856 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-15 05:42:39,856 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-15 05:42:39,857 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-15 05:42:39,857 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-15 05:42:39,857 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-15 05:42:39,858 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-15 05:42:39,858 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-15 05:42:39,859 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-15 05:42:39,859 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-15 05:42:39,859 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-15 05:42:39,860 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-15 05:42:39,860 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-15 05:42:39,860 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-15 05:42:39,861 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-15 05:42:39,861 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-15 05:42:39,861 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-15 05:42:39,862 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-15 05:42:39,862 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-15 05:42:39,863 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-15 05:42:39,863 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-15 05:42:39,863 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-15 05:42:39,864 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-15 05:42:39,864 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-15 05:42:39,864 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-15 05:42:39,865 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-15 05:42:39,865 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-15 05:42:39,865 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-15 05:42:39,866 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-15 05:42:39,866 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-15 05:42:39,867 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-15 05:42:39,867 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-15 05:42:39,868 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-15 05:42:39,868 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-15 05:42:39,868 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-15 05:42:39,869 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-15 05:42:39,869 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-15 05:42:39,869 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-15 05:42:39,870 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-15 05:42:39,870 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-15 05:42:39,871 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-15 05:42:39,871 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-15 05:42:39,871 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-15 05:42:39,872 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-15 05:42:39,872 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-15 05:42:39,872 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-15 05:42:39,873 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-15 05:42:39,873 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-15 05:42:39,874 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-15 05:42:39,874 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-15 05:42:39,874 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-15 05:42:39,875 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-15 05:42:39,875 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-15 05:42:39,875 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-15 05:42:39,876 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-15 05:42:39,876 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-15 05:42:39,877 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-15 05:42:39,878 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-15 05:42:39,878 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-15 05:42:39,878 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-15 05:42:39,879 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-15 05:42:39,879 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-15 05:42:39,879 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-15 05:42:39,880 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-15 05:42:39,880 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-15 05:42:39,881 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-15 05:42:39,881 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-15 05:42:39,881 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-15 05:42:39,882 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-15 05:42:39,882 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-15 05:42:39,882 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-15 05:42:39,883 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-15 05:42:39,883 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-15 05:42:39,883 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-15 05:42:39,884 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-15 05:42:39,884 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-15 05:42:39,885 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-15 05:42:39,885 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-15 05:42:39,885 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-15 05:42:39,886 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-15 05:42:39,886 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-15 05:42:39,886 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-15 05:42:39,887 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-15 05:42:39,887 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-15 05:42:39,887 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-15 05:42:39,888 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-15 05:42:39,888 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-15 05:42:39,889 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-15 05:42:39,889 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-15 05:42:39,889 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-15 05:42:39,890 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-15 05:42:39,890 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-15 05:42:39,890 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-15 05:42:39,891 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-15 05:42:39,891 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-15 05:42:39,892 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-15 05:42:39,892 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-15 05:42:39,892 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-15 05:42:39,893 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-15 05:42:39,893 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-15 05:42:39,893 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-15 05:42:39,894 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-15 05:42:39,894 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-15 05:42:39,894 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-15 05:42:39,895 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-15 05:42:39,895 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-15 05:42:39,896 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-15 05:42:39,896 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-15 05:42:39,896 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-15 05:42:39,897 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-15 05:42:39,897 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-15 05:42:39,897 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-15 05:42:39,898 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-15 05:42:39,898 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-15 05:42:39,898 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-15 05:42:39,899 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-15 05:42:39,899 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-15 05:42:39,900 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-15 05:42:39,900 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-15 05:42:39,900 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-15 05:42:39,901 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-15 05:42:39,901 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-15 05:42:39,901 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-15 05:42:39,902 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-15 05:42:39,902 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-15 05:42:39,902 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-15 05:42:39,903 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-15 05:42:39,903 INFO L290 TraceCheckUtils]: 150: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-15 05:42:39,903 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-15 05:42:39,903 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-15 05:42:39,903 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-15 05:42:39,903 INFO L290 TraceCheckUtils]: 154: Hoare triple {25363#false} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-15 05:42:39,903 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-15 05:42:39,903 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-15 05:42:39,903 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-15 05:42:39,903 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-15 05:42:39,904 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-15 05:42:39,904 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-15 05:42:39,905 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-15 05:42:39,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395664217] [2022-04-15 05:42:39,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395664217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110734980] [2022-04-15 05:42:39,905 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:39,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:39,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:39,911 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-15 05:42:39,912 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-15 05:42:40,121 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:42:40,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:40,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:42:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:40,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:40,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25362#true} is VALID [2022-04-15 05:42:40,652 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-15 05:42:40,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-15 05:42:40,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-15 05:42:40,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-15 05:42:40,681 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-15 05:42:40,681 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-15 05:42:40,681 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-15 05:42:40,682 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-15 05:42:40,682 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-15 05:42:40,682 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-15 05:42:40,682 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-15 05:42:40,683 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-15 05:42:40,683 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-15 05:42:40,683 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-15 05:42:40,684 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-15 05:42:40,684 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-15 05:42:40,684 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-15 05:42:40,684 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-15 05:42:40,685 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-15 05:42:40,685 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-15 05:42:40,685 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-15 05:42:40,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {25390#(<= 20 main_~edgecount~0)} ~i~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:42:40,686 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-15 05:42:40,686 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-15 05:42:40,686 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-15 05:42:40,687 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-15 05:42:40,687 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-15 05:42:40,687 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-15 05:42:40,687 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-15 05:42:40,688 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-15 05:42:40,688 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-15 05:42:40,688 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-15 05:42:40,688 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-15 05:42:40,689 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-15 05:42:40,689 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-15 05:42:40,689 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-15 05:42:40,690 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-15 05:42:40,690 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-15 05:42:40,690 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-15 05:42:40,690 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-15 05:42:40,691 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-15 05:42:40,691 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-15 05:42:40,691 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-15 05:42:40,691 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-15 05:42:40,692 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-15 05:42:40,692 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-15 05:42:40,692 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-15 05:42:40,693 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-15 05:42:40,693 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-15 05:42:40,693 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-15 05:42:40,693 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-15 05:42:40,694 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-15 05:42:40,694 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-15 05:42:40,694 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-15 05:42:40,694 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-15 05:42:40,695 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-15 05:42:40,695 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-15 05:42:40,695 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-15 05:42:40,696 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-15 05:42:40,696 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-15 05:42:40,696 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-15 05:42:40,696 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-15 05:42:40,697 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-15 05:42:40,697 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-15 05:42:40,697 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-15 05:42:40,697 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-15 05:42:40,698 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-15 05:42:40,698 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-15 05:42:40,698 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-15 05:42:40,699 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-15 05:42:40,699 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-15 05:42:40,699 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-15 05:42:40,699 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-15 05:42:40,700 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-15 05:42:40,700 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-15 05:42:40,700 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-15 05:42:40,700 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-15 05:42:40,701 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-15 05:42:40,701 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-15 05:42:40,701 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-15 05:42:40,702 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-15 05:42:40,702 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-15 05:42:40,702 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-15 05:42:40,702 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-15 05:42:40,703 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-15 05:42:40,703 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-15 05:42:40,703 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-15 05:42:40,703 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-15 05:42:40,704 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-15 05:42:40,704 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-15 05:42:40,704 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-15 05:42:40,705 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-15 05:42:40,705 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-15 05:42:40,705 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-15 05:42:40,705 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-15 05:42:40,706 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-15 05:42:40,706 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-15 05:42:40,706 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-15 05:42:40,706 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-15 05:42:40,707 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-15 05:42:40,707 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-15 05:42:40,707 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-15 05:42:40,708 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-15 05:42:40,708 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-15 05:42:40,708 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-15 05:42:40,708 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-15 05:42:40,709 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-15 05:42:40,709 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-15 05:42:40,709 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-15 05:42:40,709 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-15 05:42:40,710 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-15 05:42:40,710 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-15 05:42:40,710 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-15 05:42:40,711 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-15 05:42:40,711 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-15 05:42:40,711 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-15 05:42:40,711 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-15 05:42:40,712 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-15 05:42:40,712 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-15 05:42:40,712 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-15 05:42:40,712 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-15 05:42:40,713 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-15 05:42:40,713 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-15 05:42:40,715 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-15 05:42:40,715 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-15 05:42:40,715 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-15 05:42:40,716 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-15 05:42:40,716 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-15 05:42:40,716 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-15 05:42:40,717 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-15 05:42:40,717 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-15 05:42:40,717 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-15 05:42:40,717 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-15 05:42:40,718 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-15 05:42:40,718 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-15 05:42:40,718 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-15 05:42:40,718 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-15 05:42:40,719 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-15 05:42:40,719 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-15 05:42:40,719 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-15 05:42:40,719 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-15 05:42:40,720 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-15 05:42:40,720 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-15 05:42:40,720 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-15 05:42:40,720 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-15 05:42:40,721 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-15 05:42:40,721 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-15 05:42:40,721 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-15 05:42:40,721 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-15 05:42:40,722 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-15 05:42:40,722 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-15 05:42:40,722 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-15 05:42:40,723 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-15 05:42:40,723 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-15 05:42:40,723 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-15 05:42:40,723 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-15 05:42:40,723 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-15 05:42:40,724 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-15 05:42:40,724 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-15 05:42:40,724 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-15 05:42:40,724 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-15 05:42:40,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:41,243 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-15 05:42:41,243 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-15 05:42:41,243 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-15 05:42:41,243 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-15 05:42:41,244 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-15 05:42:41,244 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-15 05:42:41,244 INFO L290 TraceCheckUtils]: 154: Hoare triple {25876#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-15 05:42:41,244 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-15 05:42:41,244 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-15 05:42:41,245 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-15 05:42:41,245 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-15 05:42:41,245 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-15 05:42:41,245 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-15 05:42:41,246 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-15 05:42:41,246 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-15 05:42:41,246 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-15 05:42:41,246 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-15 05:42:41,247 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-15 05:42:41,247 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-15 05:42:41,247 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-15 05:42:41,248 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-15 05:42:41,248 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-15 05:42:41,248 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-15 05:42:41,248 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-15 05:42:41,249 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-15 05:42:41,249 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-15 05:42:41,249 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-15 05:42:41,249 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-15 05:42:41,249 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-15 05:42:41,250 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-15 05:42:41,250 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-15 05:42:41,250 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-15 05:42:41,250 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-15 05:42:41,251 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-15 05:42:41,251 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-15 05:42:41,251 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-15 05:42:41,251 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-15 05:42:41,252 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-15 05:42:41,252 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-15 05:42:41,252 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-15 05:42:41,252 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-15 05:42:41,253 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-15 05:42:41,253 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-15 05:42:41,253 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-15 05:42:41,253 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-15 05:42:41,253 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-15 05:42:41,254 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-15 05:42:41,254 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-15 05:42:41,254 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-15 05:42:41,254 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-15 05:42:41,255 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-15 05:42:41,255 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-15 05:42:41,255 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-15 05:42:41,255 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-15 05:42:41,256 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-15 05:42:41,256 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-15 05:42:41,256 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-15 05:42:41,256 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-15 05:42:41,256 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-15 05:42:41,257 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-15 05:42:41,257 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-15 05:42:41,257 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-15 05:42:41,257 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-15 05:42:41,258 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-15 05:42:41,258 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-15 05:42:41,258 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-15 05:42:41,258 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-15 05:42:41,259 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-15 05:42:41,259 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-15 05:42:41,259 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-15 05:42:41,259 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-15 05:42:41,260 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-15 05:42:41,260 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-15 05:42:41,260 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-15 05:42:41,260 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-15 05:42:41,260 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-15 05:42:41,261 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-15 05:42:41,261 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-15 05:42:41,261 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-15 05:42:41,261 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-15 05:42:41,262 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-15 05:42:41,262 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-15 05:42:41,262 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-15 05:42:41,262 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-15 05:42:41,263 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-15 05:42:41,263 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-15 05:42:41,263 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-15 05:42:41,263 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-15 05:42:41,264 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-15 05:42:41,264 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-15 05:42:41,264 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-15 05:42:41,264 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-15 05:42:41,264 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-15 05:42:41,265 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-15 05:42:41,265 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-15 05:42:41,265 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-15 05:42:41,265 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-15 05:42:41,266 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-15 05:42:41,266 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-15 05:42:41,266 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-15 05:42:41,266 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-15 05:42:41,267 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-15 05:42:41,267 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-15 05:42:41,267 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-15 05:42:41,267 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-15 05:42:41,268 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-15 05:42:41,268 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-15 05:42:41,268 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-15 05:42:41,268 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-15 05:42:41,268 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-15 05:42:41,269 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-15 05:42:41,269 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-15 05:42:41,269 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-15 05:42:41,269 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-15 05:42:41,270 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-15 05:42:41,270 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-15 05:42:41,270 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-15 05:42:41,270 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-15 05:42:41,271 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-15 05:42:41,271 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-15 05:42:41,271 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-15 05:42:41,271 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-15 05:42:41,271 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-15 05:42:41,272 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-15 05:42:41,272 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-15 05:42:41,272 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-15 05:42:41,272 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-15 05:42:41,273 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-15 05:42:41,273 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-15 05:42:41,273 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-15 05:42:41,273 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-15 05:42:41,274 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-15 05:42:41,274 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-15 05:42:41,274 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-15 05:42:41,274 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-15 05:42:41,274 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-15 05:42:41,275 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-15 05:42:41,275 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-15 05:42:41,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {25890#(< 1 main_~edgecount~0)} ~i~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-15 05:42:41,275 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-15 05:42:41,276 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-15 05:42:41,276 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-15 05:42:41,276 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-15 05:42:41,276 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-15 05:42:41,277 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-15 05:42:41,277 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-15 05:42:41,277 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-15 05:42:41,277 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-15 05:42:41,277 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-15 05:42:41,278 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-15 05:42:41,278 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-15 05:42:41,278 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-15 05:42:41,278 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-15 05:42:41,279 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-15 05:42:41,279 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-15 05:42:41,280 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-15 05:42:41,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-15 05:42:41,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-15 05:42:41,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-15 05:42:41,281 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-15 05:42:41,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25362#true} is VALID [2022-04-15 05:42:41,282 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-15 05:42:41,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110734980] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:41,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:41,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-15 05:42:41,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:41,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [204648485] [2022-04-15 05:42:41,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [204648485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:41,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:41,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:42:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965059335] [2022-04-15 05:42:41,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:41,284 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-15 05:42:41,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:41,284 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-15 05:42:41,303 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-15 05:42:41,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:42:41,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:41,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:42:41,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:42:41,304 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-15 05:42:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:42,735 INFO L93 Difference]: Finished difference Result 329 states and 424 transitions. [2022-04-15 05:42:42,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:42:42,735 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-15 05:42:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:42,736 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-15 05:42:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-15 05:42:42,737 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-15 05:42:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-15 05:42:42,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-15 05:42:42,846 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-15 05:42:42,853 INFO L225 Difference]: With dead ends: 329 [2022-04-15 05:42:42,853 INFO L226 Difference]: Without dead ends: 313 [2022-04-15 05:42:42,854 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-15 05:42:42,854 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-15 05:42:42,855 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-15 05:42:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-15 05:42:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 229. [2022-04-15 05:42:43,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:43,695 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-15 05:42:43,696 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-15 05:42:43,696 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-15 05:42:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:43,700 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2022-04-15 05:42:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 406 transitions. [2022-04-15 05:42:43,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:43,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:43,701 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-15 05:42:43,701 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-15 05:42:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:43,705 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2022-04-15 05:42:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 406 transitions. [2022-04-15 05:42:43,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:43,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:43,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:43,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:43,706 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-15 05:42:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2022-04-15 05:42:43,709 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 161 [2022-04-15 05:42:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:43,710 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2022-04-15 05:42:43,710 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-15 05:42:43,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 296 transitions. [2022-04-15 05:42:44,186 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-15 05:42:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-04-15 05:42:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-15 05:42:44,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:44,187 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-15 05:42:44,206 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-15 05:42:44,411 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-15 05:42:44,411 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:44,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:44,412 INFO L85 PathProgramCache]: Analyzing trace with hash 54436442, now seen corresponding path program 49 times [2022-04-15 05:42:44,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:44,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472422988] [2022-04-15 05:42:44,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:44,414 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:44,415 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:44,415 INFO L85 PathProgramCache]: Analyzing trace with hash 54436442, now seen corresponding path program 50 times [2022-04-15 05:42:44,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:44,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070286627] [2022-04-15 05:42:44,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:44,641 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-15 05:42:44,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-15 05:42:44,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-15 05:42:44,642 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-15 05:42:44,642 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-15 05:42:44,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-15 05:42:44,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-15 05:42:44,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-15 05:42:44,644 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-15 05:42:44,644 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-15 05:42:44,644 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-15 05:42:44,644 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-15 05:42:44,644 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-15 05:42:44,645 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-15 05:42:44,645 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-15 05:42:44,645 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-15 05:42:44,645 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-15 05:42:44,646 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-15 05:42:44,646 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-15 05:42:44,646 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-15 05:42:44,646 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-15 05:42:44,647 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-15 05:42:44,647 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-15 05:42:44,647 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-15 05:42:44,647 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-15 05:42:44,648 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-15 05:42:44,648 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-15 05:42:44,648 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-15 05:42:44,649 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-15 05:42:44,649 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-15 05:42:44,650 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-15 05:42:44,650 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-15 05:42:44,650 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-15 05:42:44,651 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-15 05:42:44,651 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-15 05:42:44,651 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-15 05:42:44,652 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-15 05:42:44,652 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-15 05:42:44,652 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-15 05:42:44,653 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-15 05:42:44,653 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-15 05:42:44,653 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-15 05:42:44,654 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-15 05:42:44,654 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-15 05:42:44,655 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-15 05:42:44,655 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-15 05:42:44,655 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-15 05:42:44,656 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-15 05:42:44,656 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-15 05:42:44,656 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-15 05:42:44,657 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-15 05:42:44,657 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-15 05:42:44,657 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-15 05:42:44,658 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-15 05:42:44,658 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-15 05:42:44,659 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-15 05:42:44,659 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-15 05:42:44,659 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-15 05:42:44,660 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-15 05:42:44,660 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-15 05:42:44,660 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-15 05:42:44,661 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-15 05:42:44,661 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-15 05:42:44,661 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-15 05:42:44,662 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-15 05:42:44,662 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-15 05:42:44,662 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-15 05:42:44,663 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-15 05:42:44,663 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-15 05:42:44,664 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-15 05:42:44,664 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-15 05:42:44,664 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-15 05:42:44,665 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-15 05:42:44,665 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-15 05:42:44,665 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-15 05:42:44,666 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-15 05:42:44,666 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-15 05:42:44,666 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-15 05:42:44,667 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-15 05:42:44,667 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-15 05:42:44,667 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-15 05:42:44,668 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-15 05:42:44,668 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-15 05:42:44,669 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-15 05:42:44,669 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-15 05:42:44,669 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-15 05:42:44,670 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-15 05:42:44,670 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-15 05:42:44,670 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-15 05:42:44,671 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-15 05:42:44,671 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-15 05:42:44,671 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-15 05:42:44,672 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-15 05:42:44,672 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-15 05:42:44,672 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-15 05:42:44,673 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-15 05:42:44,673 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-15 05:42:44,673 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-15 05:42:44,674 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-15 05:42:44,674 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-15 05:42:44,675 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-15 05:42:44,675 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-15 05:42:44,675 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-15 05:42:44,676 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-15 05:42:44,676 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-15 05:42:44,676 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-15 05:42:44,678 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-15 05:42:44,678 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-15 05:42:44,678 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-15 05:42:44,679 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-15 05:42:44,679 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-15 05:42:44,679 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-15 05:42:44,680 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-15 05:42:44,680 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-15 05:42:44,681 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-15 05:42:44,681 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-15 05:42:44,681 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-15 05:42:44,682 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-15 05:42:44,682 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-15 05:42:44,682 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-15 05:42:44,683 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-15 05:42:44,683 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-15 05:42:44,683 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-15 05:42:44,684 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-15 05:42:44,684 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-15 05:42:44,684 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-15 05:42:44,685 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-15 05:42:44,685 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-15 05:42:44,685 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-15 05:42:44,686 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-15 05:42:44,686 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-15 05:42:44,687 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-15 05:42:44,687 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-15 05:42:44,687 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-15 05:42:44,688 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-15 05:42:44,688 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-15 05:42:44,688 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-15 05:42:44,689 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-15 05:42:44,689 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-15 05:42:44,689 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-15 05:42:44,690 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-15 05:42:44,690 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-15 05:42:44,691 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-15 05:42:44,691 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-15 05:42:44,691 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-15 05:42:44,692 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-15 05:42:44,692 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-15 05:42:44,692 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-15 05:42:44,693 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-15 05:42:44,693 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-15 05:42:44,693 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-15 05:42:44,694 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-15 05:42:44,694 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-15 05:42:44,695 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-15 05:42:44,695 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-15 05:42:44,695 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-15 05:42:44,696 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-15 05:42:44,696 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-15 05:42:44,696 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-15 05:42:44,697 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-15 05:42:44,697 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-15 05:42:44,697 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-15 05:42:44,698 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-15 05:42:44,698 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-15 05:42:44,698 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-15 05:42:44,699 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-15 05:42:44,699 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-15 05:42:44,700 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-15 05:42:44,700 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-15 05:42:44,700 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-15 05:42:44,701 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-15 05:42:44,701 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-15 05:42:44,701 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-15 05:42:44,702 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-15 05:42:44,702 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-15 05:42:44,702 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-15 05:42:44,703 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-15 05:42:44,703 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-15 05:42:44,704 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-15 05:42:44,704 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-15 05:42:44,704 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-15 05:42:44,705 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-15 05:42:44,705 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-15 05:42:44,705 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-15 05:42:44,706 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-15 05:42:44,706 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-15 05:42:44,706 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-15 05:42:44,707 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-15 05:42:44,707 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-15 05:42:44,708 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-15 05:42:44,708 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-15 05:42:44,708 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-15 05:42:44,709 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-15 05:42:44,709 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-15 05:42:44,709 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-15 05:42:44,710 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-15 05:42:44,710 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-15 05:42:44,710 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-15 05:42:44,711 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-15 05:42:44,711 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-15 05:42:44,711 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-15 05:42:44,712 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-15 05:42:44,712 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-15 05:42:44,712 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-15 05:42:44,713 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-15 05:42:44,713 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-15 05:42:44,714 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-15 05:42:44,714 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-15 05:42:44,714 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-15 05:42:44,715 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-15 05:42:44,715 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-15 05:42:44,715 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-15 05:42:44,716 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-15 05:42:44,716 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-15 05:42:44,716 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-15 05:42:44,717 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-15 05:42:44,717 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-15 05:42:44,717 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-15 05:42:44,717 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-15 05:42:44,717 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-15 05:42:44,717 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-15 05:42:44,717 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-15 05:42:44,717 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-15 05:42:44,717 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-15 05:42:44,717 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-15 05:42:44,718 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-15 05:42:44,718 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-15 05:42:44,720 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-15 05:42:44,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:44,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070286627] [2022-04-15 05:42:44,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070286627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:44,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497041698] [2022-04-15 05:42:44,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:44,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:44,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:44,721 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-15 05:42:44,722 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-15 05:42:45,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:45,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:45,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:42:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:45,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:46,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28093#true} is VALID [2022-04-15 05:42:46,476 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-15 05:42:46,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-15 05:42:46,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-15 05:42:46,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-15 05:42:46,478 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-15 05:42:46,478 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-15 05:42:46,478 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-15 05:42:46,479 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-15 05:42:46,479 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-15 05:42:46,479 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-15 05:42:46,479 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-15 05:42:46,480 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-15 05:42:46,480 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-15 05:42:46,480 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-15 05:42:46,480 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-15 05:42:46,481 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-15 05:42:46,481 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-15 05:42:46,481 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-15 05:42:46,482 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-15 05:42:46,482 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-15 05:42:46,482 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-15 05:42:46,482 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-15 05:42:46,483 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-15 05:42:46,483 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-15 05:42:46,484 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-15 05:42:46,484 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-15 05:42:46,498 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-15 05:42:46,499 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-15 05:42:46,499 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-15 05:42:46,499 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-15 05:42:46,500 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-15 05:42:46,500 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-15 05:42:46,501 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-15 05:42:46,501 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-15 05:42:46,501 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-15 05:42:46,502 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-15 05:42:46,502 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-15 05:42:46,503 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-15 05:42:46,503 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-15 05:42:46,504 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-15 05:42:46,504 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-15 05:42:46,504 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-15 05:42:46,505 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-15 05:42:46,505 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-15 05:42:46,506 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-15 05:42:46,506 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-15 05:42:46,506 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-15 05:42:46,507 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-15 05:42:46,507 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-15 05:42:46,508 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-15 05:42:46,508 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-15 05:42:46,509 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-15 05:42:46,509 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-15 05:42:46,509 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-15 05:42:46,510 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-15 05:42:46,510 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-15 05:42:46,511 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-15 05:42:46,511 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-15 05:42:46,512 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-15 05:42:46,512 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-15 05:42:46,512 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-15 05:42:46,513 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-15 05:42:46,513 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-15 05:42:46,514 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-15 05:42:46,514 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-15 05:42:46,514 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-15 05:42:46,515 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-15 05:42:46,515 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-15 05:42:46,516 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-15 05:42:46,516 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-15 05:42:46,517 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-15 05:42:46,517 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-15 05:42:46,518 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-15 05:42:46,518 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-15 05:42:46,518 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-15 05:42:46,519 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-15 05:42:46,521 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-15 05:42:46,521 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-15 05:42:46,522 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-15 05:42:46,522 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-15 05:42:46,522 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-15 05:42:46,523 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-15 05:42:46,523 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-15 05:42:46,524 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-15 05:42:46,524 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-15 05:42:46,524 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-15 05:42:46,525 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-15 05:42:46,525 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-15 05:42:46,526 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-15 05:42:46,526 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-15 05:42:46,527 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-15 05:42:46,527 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-15 05:42:46,527 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-15 05:42:46,528 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-15 05:42:46,528 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-15 05:42:46,529 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-15 05:42:46,529 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-15 05:42:46,529 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-15 05:42:46,530 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-15 05:42:46,530 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-15 05:42:46,531 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-15 05:42:46,531 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-15 05:42:46,532 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-15 05:42:46,532 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-15 05:42:46,532 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-15 05:42:46,533 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-15 05:42:46,533 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-15 05:42:46,534 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-15 05:42:46,534 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-15 05:42:46,534 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-15 05:42:46,535 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-15 05:42:46,535 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-15 05:42:46,536 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-15 05:42:46,536 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-15 05:42:46,537 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-15 05:42:46,537 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-15 05:42:46,537 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-15 05:42:46,538 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-15 05:42:46,538 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-15 05:42:46,539 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-15 05:42:46,539 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-15 05:42:46,539 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-15 05:42:46,540 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-15 05:42:46,540 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-15 05:42:46,541 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-15 05:42:46,541 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-15 05:42:46,542 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-15 05:42:46,542 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-15 05:42:46,542 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-15 05:42:46,543 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-15 05:42:46,543 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-15 05:42:46,544 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-15 05:42:46,544 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-15 05:42:46,544 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-15 05:42:46,545 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-15 05:42:46,545 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-15 05:42:46,546 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-15 05:42:46,546 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-15 05:42:46,547 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-15 05:42:46,547 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-15 05:42:46,547 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-15 05:42:46,548 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-15 05:42:46,548 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-15 05:42:46,549 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-15 05:42:46,549 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-15 05:42:46,549 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-15 05:42:46,550 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-15 05:42:46,550 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-15 05:42:46,551 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-15 05:42:46,551 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-15 05:42:46,552 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-15 05:42:46,552 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-15 05:42:46,552 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-15 05:42:46,553 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-15 05:42:46,553 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-15 05:42:46,554 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-15 05:42:46,554 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-15 05:42:46,555 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-15 05:42:46,555 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-15 05:42:46,555 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-15 05:42:46,556 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-15 05:42:46,556 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-15 05:42:46,557 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-15 05:42:46,557 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-15 05:42:46,558 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-15 05:42:46,558 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-15 05:42:46,558 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-15 05:42:46,559 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-15 05:42:46,559 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-15 05:42:46,560 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-15 05:42:46,560 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-15 05:42:46,561 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-15 05:42:46,561 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-15 05:42:46,561 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-15 05:42:46,562 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-15 05:42:46,562 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-15 05:42:46,563 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-15 05:42:46,563 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-15 05:42:46,563 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-15 05:42:46,564 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-15 05:42:46,564 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-15 05:42:46,565 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-15 05:42:46,565 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-15 05:42:46,566 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-15 05:42:46,566 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-15 05:42:46,566 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-15 05:42:46,567 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-15 05:42:46,567 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-15 05:42:46,568 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-15 05:42:46,568 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-15 05:42:46,568 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-15 05:42:46,569 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-15 05:42:46,569 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-15 05:42:46,570 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-15 05:42:46,570 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-15 05:42:46,571 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-15 05:42:46,571 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-15 05:42:46,572 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-15 05:42:46,572 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-15 05:42:46,572 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-15 05:42:46,573 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-15 05:42:46,573 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-15 05:42:46,574 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-15 05:42:46,574 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-15 05:42:46,574 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-15 05:42:46,575 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-15 05:42:46,575 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-15 05:42:46,576 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-15 05:42:46,576 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-15 05:42:46,576 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-15 05:42:46,577 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-15 05:42:46,577 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-15 05:42:46,577 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-15 05:42:46,577 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-15 05:42:46,578 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-15 05:42:46,578 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-15 05:42:46,578 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-15 05:42:46,578 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-15 05:42:46,578 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-15 05:42:46,578 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-15 05:42:46,578 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-15 05:42:46,578 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-15 05:42:46,578 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-15 05:42:46,580 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-15 05:42:46,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:47,313 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-15 05:42:47,314 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-15 05:42:47,314 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-15 05:42:47,314 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-15 05:42:47,314 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-15 05:42:47,314 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-15 05:42:47,314 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-15 05:42:47,314 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-15 05:42:47,314 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-15 05:42:47,314 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-15 05:42:47,314 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-15 05:42:47,315 INFO L290 TraceCheckUtils]: 212: Hoare triple {28814#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {28094#false} is VALID [2022-04-15 05:42:47,315 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-15 05:42:47,315 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-15 05:42:47,316 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-15 05:42:47,316 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-15 05:42:47,316 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-15 05:42:47,316 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-15 05:42:47,317 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-15 05:42:47,317 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-15 05:42:47,317 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-15 05:42:47,317 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-15 05:42:47,318 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-15 05:42:47,318 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-15 05:42:47,318 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-15 05:42:47,318 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-15 05:42:47,319 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-15 05:42:47,319 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-15 05:42:47,319 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-15 05:42:47,319 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-15 05:42:47,320 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-15 05:42:47,320 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-15 05:42:47,320 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-15 05:42:47,320 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-15 05:42:47,321 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-15 05:42:47,321 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-15 05:42:47,321 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-15 05:42:47,321 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-15 05:42:47,322 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-15 05:42:47,322 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-15 05:42:47,322 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-15 05:42:47,322 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-15 05:42:47,323 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-15 05:42:47,323 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-15 05:42:47,323 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-15 05:42:47,323 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-15 05:42:47,324 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-15 05:42:47,324 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-15 05:42:47,324 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-15 05:42:47,324 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-15 05:42:47,325 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-15 05:42:47,325 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-15 05:42:47,325 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-15 05:42:47,325 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-15 05:42:47,326 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-15 05:42:47,326 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-15 05:42:47,326 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-15 05:42:47,326 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-15 05:42:47,327 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-15 05:42:47,327 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-15 05:42:47,327 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-15 05:42:47,327 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-15 05:42:47,328 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-15 05:42:47,328 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-15 05:42:47,328 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-15 05:42:47,328 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-15 05:42:47,329 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-15 05:42:47,329 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-15 05:42:47,329 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-15 05:42:47,329 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-15 05:42:47,330 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-15 05:42:47,330 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-15 05:42:47,330 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-15 05:42:47,330 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-15 05:42:47,331 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-15 05:42:47,331 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-15 05:42:47,331 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-15 05:42:47,331 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-15 05:42:47,332 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-15 05:42:47,332 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-15 05:42:47,332 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-15 05:42:47,332 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-15 05:42:47,333 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-15 05:42:47,333 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-15 05:42:47,333 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-15 05:42:47,333 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-15 05:42:47,334 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-15 05:42:47,334 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-15 05:42:47,334 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-15 05:42:47,335 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-15 05:42:47,335 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-15 05:42:47,335 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-15 05:42:47,335 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-15 05:42:47,336 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-15 05:42:47,336 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-15 05:42:47,336 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-15 05:42:47,336 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-15 05:42:47,337 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-15 05:42:47,337 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-15 05:42:47,337 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-15 05:42:47,337 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-15 05:42:47,338 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-15 05:42:47,338 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-15 05:42:47,338 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-15 05:42:47,338 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-15 05:42:47,339 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-15 05:42:47,339 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-15 05:42:47,339 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-15 05:42:47,339 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-15 05:42:47,340 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-15 05:42:47,340 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-15 05:42:47,340 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-15 05:42:47,340 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-15 05:42:47,341 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-15 05:42:47,341 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-15 05:42:47,341 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-15 05:42:47,341 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-15 05:42:47,342 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-15 05:42:47,342 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-15 05:42:47,342 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-15 05:42:47,342 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-15 05:42:47,343 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-15 05:42:47,343 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-15 05:42:47,343 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-15 05:42:47,343 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-15 05:42:47,344 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-15 05:42:47,344 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-15 05:42:47,344 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-15 05:42:47,344 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-15 05:42:47,345 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-15 05:42:47,345 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-15 05:42:47,345 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-15 05:42:47,345 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-15 05:42:47,346 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-15 05:42:47,346 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-15 05:42:47,346 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-15 05:42:47,346 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-15 05:42:47,347 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-15 05:42:47,347 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-15 05:42:47,347 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-15 05:42:47,348 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-15 05:42:47,348 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-15 05:42:47,348 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-15 05:42:47,348 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-15 05:42:47,349 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-15 05:42:47,349 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-15 05:42:47,349 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-15 05:42:47,349 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-15 05:42:47,349 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-15 05:42:47,350 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-15 05:42:47,367 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-15 05:42:47,367 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-15 05:42:47,368 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-15 05:42:47,368 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-15 05:42:47,368 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-15 05:42:47,368 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-15 05:42:47,369 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-15 05:42:47,369 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-15 05:42:47,369 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-15 05:42:47,369 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-15 05:42:47,370 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-15 05:42:47,370 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-15 05:42:47,370 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-15 05:42:47,370 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-15 05:42:47,371 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-15 05:42:47,371 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-15 05:42:47,371 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-15 05:42:47,371 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-15 05:42:47,372 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-15 05:42:47,372 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-15 05:42:47,372 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-15 05:42:47,372 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-15 05:42:47,373 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-15 05:42:47,373 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-15 05:42:47,373 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-15 05:42:47,373 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-15 05:42:47,374 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-15 05:42:47,374 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-15 05:42:47,374 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-15 05:42:47,374 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-15 05:42:47,375 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-15 05:42:47,375 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-15 05:42:47,375 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-15 05:42:47,375 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-15 05:42:47,376 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-15 05:42:47,376 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-15 05:42:47,376 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-15 05:42:47,376 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-15 05:42:47,377 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-15 05:42:47,377 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-15 05:42:47,377 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-15 05:42:47,377 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-15 05:42:47,378 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-15 05:42:47,378 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-15 05:42:47,378 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-15 05:42:47,378 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-15 05:42:47,379 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-15 05:42:47,379 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-15 05:42:47,379 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-15 05:42:47,379 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-15 05:42:47,380 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-15 05:42:47,380 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-15 05:42:47,380 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-15 05:42:47,381 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-15 05:42:47,381 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-15 05:42:47,381 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-15 05:42:47,381 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-15 05:42:47,381 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-15 05:42:47,382 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-15 05:42:47,382 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-15 05:42:47,382 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-15 05:42:47,382 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-15 05:42:47,383 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-15 05:42:47,383 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-15 05:42:47,383 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-15 05:42:47,383 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-15 05:42:47,384 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-15 05:42:47,384 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-15 05:42:47,386 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-15 05:42:47,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-15 05:42:47,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-15 05:42:47,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-15 05:42:47,386 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-15 05:42:47,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28093#true} is VALID [2022-04-15 05:42:47,388 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-15 05:42:47,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497041698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:47,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:47,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-15 05:42:47,388 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:47,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472422988] [2022-04-15 05:42:47,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472422988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:47,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:47,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:42:47,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964460537] [2022-04-15 05:42:47,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:47,389 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-15 05:42:47,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:47,389 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-15 05:42:47,416 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-15 05:42:47,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:42:47,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:47,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:42:47,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:42:47,417 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-15 05:42:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:49,175 INFO L93 Difference]: Finished difference Result 400 states and 518 transitions. [2022-04-15 05:42:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:42:49,176 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-15 05:42:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:49,176 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-15 05:42:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-15 05:42:49,177 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-15 05:42:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-15 05:42:49,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2022-04-15 05:42:49,287 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-15 05:42:49,293 INFO L225 Difference]: With dead ends: 400 [2022-04-15 05:42:49,293 INFO L226 Difference]: Without dead ends: 384 [2022-04-15 05:42:49,293 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-15 05:42:49,294 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-15 05:42:49,294 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-15 05:42:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-04-15 05:42:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 292. [2022-04-15 05:42:50,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:50,399 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-15 05:42:50,399 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-15 05:42:50,399 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-15 05:42:50,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:50,405 INFO L93 Difference]: Finished difference Result 384 states and 500 transitions. [2022-04-15 05:42:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 500 transitions. [2022-04-15 05:42:50,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:50,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:50,406 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-15 05:42:50,406 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-15 05:42:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:50,412 INFO L93 Difference]: Finished difference Result 384 states and 500 transitions. [2022-04-15 05:42:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 500 transitions. [2022-04-15 05:42:50,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:50,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:50,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:50,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:50,413 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-15 05:42:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 380 transitions. [2022-04-15 05:42:50,417 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 380 transitions. Word has length 224 [2022-04-15 05:42:50,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:50,418 INFO L478 AbstractCegarLoop]: Abstraction has 292 states and 380 transitions. [2022-04-15 05:42:50,418 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-15 05:42:50,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 292 states and 380 transitions. [2022-04-15 05:42:51,120 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-15 05:42:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 380 transitions. [2022-04-15 05:42:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-04-15 05:42:51,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:51,123 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-15 05:42:51,143 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-15 05:42:51,343 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-15 05:42:51,343 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash -381796264, now seen corresponding path program 51 times [2022-04-15 05:42:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:51,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1449239738] [2022-04-15 05:42:51,347 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:51,347 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:51,347 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash -381796264, now seen corresponding path program 52 times [2022-04-15 05:42:51,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:51,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384681149] [2022-04-15 05:42:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:51,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:51,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:51,650 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-15 05:42:51,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-15 05:42:51,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-15 05:42:51,651 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-15 05:42:51,651 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-15 05:42:51,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-15 05:42:51,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-15 05:42:51,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-15 05:42:51,653 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-15 05:42:51,653 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-15 05:42:51,654 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-15 05:42:51,654 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-15 05:42:51,654 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-15 05:42:51,654 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-15 05:42:51,655 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-15 05:42:51,655 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-15 05:42:51,655 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-15 05:42:51,656 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-15 05:42:51,656 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-15 05:42:51,656 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-15 05:42:51,656 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-15 05:42:51,657 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-15 05:42:51,657 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-15 05:42:51,657 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-15 05:42:51,658 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-15 05:42:51,658 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-15 05:42:51,658 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-15 05:42:51,659 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-15 05:42:51,663 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-15 05:42:51,664 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-15 05:42:51,664 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-15 05:42:51,665 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-15 05:42:51,665 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-15 05:42:51,666 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-15 05:42:51,666 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-15 05:42:51,667 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-15 05:42:51,667 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-15 05:42:51,668 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-15 05:42:51,668 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-15 05:42:51,668 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-15 05:42:51,669 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-15 05:42:51,669 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-15 05:42:51,670 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-15 05:42:51,670 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-15 05:42:51,671 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-15 05:42:51,671 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-15 05:42:51,672 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-15 05:42:51,672 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-15 05:42:51,672 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-15 05:42:51,673 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-15 05:42:51,673 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-15 05:42:51,674 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-15 05:42:51,674 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-15 05:42:51,675 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-15 05:42:51,675 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-15 05:42:51,676 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-15 05:42:51,676 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-15 05:42:51,676 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-15 05:42:51,677 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-15 05:42:51,677 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-15 05:42:51,678 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-15 05:42:51,678 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-15 05:42:51,678 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-15 05:42:51,679 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-15 05:42:51,679 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-15 05:42:51,680 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-15 05:42:51,680 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-15 05:42:51,681 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-15 05:42:51,681 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-15 05:42:51,681 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-15 05:42:51,682 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-15 05:42:51,682 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-15 05:42:51,683 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-15 05:42:51,683 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-15 05:42:51,683 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-15 05:42:51,684 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-15 05:42:51,684 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-15 05:42:51,685 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-15 05:42:51,685 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-15 05:42:51,686 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-15 05:42:51,686 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-15 05:42:51,686 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-15 05:42:51,687 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-15 05:42:51,687 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-15 05:42:51,688 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-15 05:42:51,688 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-15 05:42:51,689 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-15 05:42:51,689 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-15 05:42:51,689 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-15 05:42:51,690 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-15 05:42:51,690 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-15 05:42:51,691 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-15 05:42:51,691 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-15 05:42:51,691 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-15 05:42:51,692 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-15 05:42:51,692 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-15 05:42:51,693 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-15 05:42:51,693 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-15 05:42:51,693 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-15 05:42:51,694 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-15 05:42:51,694 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-15 05:42:51,695 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-15 05:42:51,695 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-15 05:42:51,696 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-15 05:42:51,696 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-15 05:42:51,696 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-15 05:42:51,697 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-15 05:42:51,697 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-15 05:42:51,698 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-15 05:42:51,698 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-15 05:42:51,698 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-15 05:42:51,699 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-15 05:42:51,699 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-15 05:42:51,700 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-15 05:42:51,700 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-15 05:42:51,701 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-15 05:42:51,701 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-15 05:42:51,701 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-15 05:42:51,702 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-15 05:42:51,702 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-15 05:42:51,703 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-15 05:42:51,703 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-15 05:42:51,703 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-15 05:42:51,704 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-15 05:42:51,704 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-15 05:42:51,705 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-15 05:42:51,705 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-15 05:42:51,706 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-15 05:42:51,706 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-15 05:42:51,706 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-15 05:42:51,707 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-15 05:42:51,707 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-15 05:42:51,708 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-15 05:42:51,708 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-15 05:42:51,709 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-15 05:42:51,709 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-15 05:42:51,710 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-15 05:42:51,710 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-15 05:42:51,710 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-15 05:42:51,711 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-15 05:42:51,711 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-15 05:42:51,712 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-15 05:42:51,712 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-15 05:42:51,712 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-15 05:42:51,713 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-15 05:42:51,713 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-15 05:42:51,714 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-15 05:42:51,714 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-15 05:42:51,714 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-15 05:42:51,715 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-15 05:42:51,715 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-15 05:42:51,715 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-15 05:42:51,716 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-15 05:42:51,716 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-15 05:42:51,717 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-15 05:42:51,717 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-15 05:42:51,717 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-15 05:42:51,718 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-15 05:42:51,718 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-15 05:42:51,719 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-15 05:42:51,719 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-15 05:42:51,719 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-15 05:42:51,720 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-15 05:42:51,720 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-15 05:42:51,720 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-15 05:42:51,721 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-15 05:42:51,721 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-15 05:42:51,722 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-15 05:42:51,722 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-15 05:42:51,722 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-15 05:42:51,723 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-15 05:42:51,723 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-15 05:42:51,724 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-15 05:42:51,724 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-15 05:42:51,724 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-15 05:42:51,725 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-15 05:42:51,725 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-15 05:42:51,725 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-15 05:42:51,726 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-15 05:42:51,726 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-15 05:42:51,727 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-15 05:42:51,727 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-15 05:42:51,727 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-15 05:42:51,728 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-15 05:42:51,728 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-15 05:42:51,729 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-15 05:42:51,729 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-15 05:42:51,729 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-15 05:42:51,730 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-15 05:42:51,730 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-15 05:42:51,731 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-15 05:42:51,731 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-15 05:42:51,731 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-15 05:42:51,732 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-15 05:42:51,732 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-15 05:42:51,732 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-15 05:42:51,733 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-15 05:42:51,733 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-15 05:42:51,734 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-15 05:42:51,734 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-15 05:42:51,734 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-15 05:42:51,735 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-15 05:42:51,735 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-15 05:42:51,735 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-15 05:42:51,736 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-15 05:42:51,736 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-15 05:42:51,737 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-15 05:42:51,737 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-15 05:42:51,737 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-15 05:42:51,738 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-15 05:42:51,738 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-15 05:42:51,739 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-15 05:42:51,739 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-15 05:42:51,739 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-15 05:42:51,740 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-15 05:42:51,740 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-15 05:42:51,740 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-15 05:42:51,741 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-15 05:42:51,741 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-15 05:42:51,742 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-15 05:42:51,742 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-15 05:42:51,742 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-15 05:42:51,743 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-15 05:42:51,743 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-15 05:42:51,743 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-15 05:42:51,744 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-15 05:42:51,744 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-15 05:42:51,745 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-15 05:42:51,745 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-15 05:42:51,745 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-15 05:42:51,746 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-15 05:42:51,746 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-15 05:42:51,747 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-15 05:42:51,747 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-15 05:42:51,747 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-15 05:42:51,748 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-15 05:42:51,748 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-15 05:42:51,748 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-15 05:42:51,749 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-15 05:42:51,749 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-15 05:42:51,750 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-15 05:42:51,750 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-15 05:42:51,750 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-15 05:42:51,751 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-15 05:42:51,751 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-15 05:42:51,751 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-15 05:42:51,752 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-15 05:42:51,752 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-15 05:42:51,753 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-15 05:42:51,753 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-15 05:42:51,753 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-15 05:42:51,754 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-15 05:42:51,754 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-15 05:42:51,755 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-15 05:42:51,755 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-15 05:42:51,755 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-15 05:42:51,756 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-15 05:42:51,756 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-15 05:42:51,756 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-15 05:42:51,757 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-15 05:42:51,757 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-15 05:42:51,758 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-15 05:42:51,758 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-15 05:42:51,758 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-15 05:42:51,759 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-15 05:42:51,759 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-15 05:42:51,759 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-15 05:42:51,760 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-15 05:42:51,760 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-15 05:42:51,761 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-15 05:42:51,761 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-15 05:42:51,761 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-15 05:42:51,762 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-15 05:42:51,762 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-15 05:42:51,763 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-15 05:42:51,763 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-15 05:42:51,763 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-15 05:42:51,764 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-15 05:42:51,764 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-15 05:42:51,764 INFO L290 TraceCheckUtils]: 276: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-15 05:42:51,764 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-15 05:42:51,764 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-15 05:42:51,764 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-15 05:42:51,764 INFO L290 TraceCheckUtils]: 280: Hoare triple {31620#false} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-15 05:42:51,764 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-15 05:42:51,764 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-15 05:42:51,765 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-15 05:42:51,765 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-15 05:42:51,765 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-15 05:42:51,765 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-15 05:42:51,768 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-15 05:42:51,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:51,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384681149] [2022-04-15 05:42:51,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384681149] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:51,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070979679] [2022-04-15 05:42:51,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:51,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:51,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:51,769 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-15 05:42:51,771 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-15 05:42:52,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:52,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:52,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 05:42:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:52,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:53,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-15 05:42:53,419 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-15 05:42:53,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-15 05:42:53,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-15 05:42:53,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-15 05:42:53,419 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-15 05:42:53,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:53,419 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-15 05:42:53,419 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-15 05:42:53,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:53,419 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-15 05:42:53,420 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-15 05:42:53,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:53,420 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-15 05:42:53,420 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-15 05:42:53,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:53,420 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-15 05:42:53,420 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-15 05:42:53,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:53,420 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-15 05:42:53,420 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-15 05:42:53,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {31619#true} assume !(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:53,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {31619#true} ~i~0 := 0; {31619#true} is VALID [2022-04-15 05:42:53,421 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-15 05:42:53,421 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-15 05:42:53,422 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-15 05:42:53,422 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-15 05:42:53,422 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-15 05:42:53,423 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-15 05:42:53,423 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-15 05:42:53,423 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-15 05:42:53,423 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-15 05:42:53,424 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-15 05:42:53,424 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-15 05:42:53,424 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-15 05:42:53,425 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-15 05:42:53,425 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-15 05:42:53,425 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-15 05:42:53,426 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-15 05:42:53,426 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-15 05:42:53,426 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-15 05:42:53,427 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-15 05:42:53,427 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-15 05:42:53,427 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-15 05:42:53,428 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-15 05:42:53,428 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-15 05:42:53,428 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-15 05:42:53,429 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-15 05:42:53,429 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-15 05:42:53,429 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-15 05:42:53,429 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-15 05:42:53,430 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-15 05:42:53,430 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-15 05:42:53,430 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-15 05:42:53,431 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-15 05:42:53,431 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-15 05:42:53,431 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-15 05:42:53,432 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-15 05:42:53,432 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-15 05:42:53,432 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-15 05:42:53,433 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-15 05:42:53,433 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-15 05:42:53,433 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-15 05:42:53,434 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-15 05:42:53,434 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-15 05:42:53,434 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-15 05:42:53,435 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-15 05:42:53,435 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-15 05:42:53,435 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-15 05:42:53,435 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-15 05:42:53,436 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-15 05:42:53,436 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-15 05:42:53,436 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-15 05:42:53,437 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-15 05:42:53,437 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-15 05:42:53,437 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-15 05:42:53,438 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-15 05:42:53,438 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-15 05:42:53,438 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-15 05:42:53,438 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-15 05:42:53,439 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-15 05:42:53,440 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-15 05:42:53,440 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-15 05:42:53,440 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-15 05:42:53,440 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-15 05:42:53,441 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-15 05:42:53,441 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-15 05:42:53,441 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-15 05:42:53,441 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-15 05:42:53,442 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-15 05:42:53,442 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-15 05:42:53,442 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-15 05:42:53,442 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-15 05:42:53,443 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-15 05:42:53,443 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-15 05:42:53,443 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-15 05:42:53,444 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-15 05:42:53,444 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-15 05:42:53,444 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-15 05:42:53,444 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-15 05:42:53,445 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-15 05:42:53,445 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-15 05:42:53,445 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-15 05:42:53,446 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-15 05:42:53,446 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-15 05:42:53,446 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-15 05:42:53,448 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-15 05:42:53,455 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-15 05:42:53,455 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-15 05:42:53,456 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-15 05:42:53,456 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-15 05:42:53,456 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-15 05:42:53,457 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-15 05:42:53,457 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-15 05:42:53,457 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-15 05:42:53,457 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-15 05:42:53,458 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-15 05:42:53,458 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-15 05:42:53,458 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-15 05:42:53,459 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-15 05:42:53,459 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-15 05:42:53,459 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-15 05:42:53,459 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-15 05:42:53,460 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-15 05:42:53,460 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-15 05:42:53,460 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-15 05:42:53,461 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-15 05:42:53,461 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-15 05:42:53,461 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-15 05:42:53,461 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-15 05:42:53,462 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-15 05:42:53,462 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-15 05:42:53,462 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-15 05:42:53,462 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-15 05:42:53,463 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-15 05:42:53,463 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-15 05:42:53,463 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-15 05:42:53,464 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-15 05:42:53,464 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-15 05:42:53,464 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-15 05:42:53,464 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-15 05:42:53,465 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-15 05:42:53,465 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-15 05:42:53,465 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-15 05:42:53,465 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-15 05:42:53,466 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-15 05:42:53,466 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-15 05:42:53,466 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-15 05:42:53,466 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-15 05:42:53,467 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-15 05:42:53,467 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-15 05:42:53,467 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-15 05:42:53,467 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-15 05:42:53,468 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-15 05:42:53,468 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-15 05:42:53,468 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-15 05:42:53,468 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-15 05:42:53,469 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-15 05:42:53,469 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-15 05:42:53,469 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-15 05:42:53,469 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-15 05:42:53,470 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-15 05:42:53,470 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-15 05:42:53,470 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-15 05:42:53,470 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-15 05:42:53,471 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-15 05:42:53,471 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-15 05:42:53,471 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-15 05:42:53,471 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-15 05:42:53,472 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-15 05:42:53,472 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-15 05:42:53,472 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-15 05:42:53,472 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-15 05:42:53,473 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-15 05:42:53,473 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-15 05:42:53,473 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-15 05:42:53,473 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-15 05:42:53,474 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-15 05:42:53,474 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-15 05:42:53,474 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-15 05:42:53,488 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-15 05:42:53,489 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-15 05:42:53,489 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-15 05:42:53,489 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-15 05:42:53,490 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-15 05:42:53,490 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-15 05:42:53,490 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-15 05:42:53,490 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-15 05:42:53,491 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-15 05:42:53,491 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-15 05:42:53,491 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-15 05:42:53,491 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-15 05:42:53,492 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-15 05:42:53,492 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-15 05:42:53,492 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-15 05:42:53,492 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-15 05:42:53,493 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-15 05:42:53,493 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-15 05:42:53,493 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-15 05:42:53,494 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-15 05:42:53,494 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-15 05:42:53,494 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-15 05:42:53,494 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-15 05:42:53,495 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-15 05:42:53,495 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-15 05:42:53,495 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-15 05:42:53,496 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-15 05:42:53,496 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-15 05:42:53,496 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-15 05:42:53,496 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-15 05:42:53,497 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-15 05:42:53,497 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-15 05:42:53,497 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-15 05:42:53,498 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-15 05:42:53,498 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-15 05:42:53,498 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-15 05:42:53,499 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-15 05:42:53,499 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-15 05:42:53,499 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-15 05:42:53,499 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-15 05:42:53,500 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-15 05:42:53,500 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-15 05:42:53,500 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-15 05:42:53,501 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-15 05:42:53,501 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-15 05:42:53,501 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-15 05:42:53,501 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-15 05:42:53,502 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-15 05:42:53,502 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-15 05:42:53,502 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-15 05:42:53,502 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-15 05:42:53,503 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-15 05:42:53,503 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-15 05:42:53,503 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-15 05:42:53,503 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-15 05:42:53,504 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-15 05:42:53,504 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-15 05:42:53,504 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-15 05:42:53,504 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-15 05:42:53,505 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-15 05:42:53,505 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-15 05:42:53,505 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-15 05:42:53,505 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-15 05:42:53,506 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-15 05:42:53,506 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-15 05:42:53,506 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-15 05:42:53,506 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-15 05:42:53,507 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-15 05:42:53,507 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-15 05:42:53,507 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-15 05:42:53,508 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-15 05:42:53,508 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-15 05:42:53,508 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-15 05:42:53,508 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-15 05:42:53,509 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-15 05:42:53,509 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-15 05:42:53,509 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-15 05:42:53,509 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-15 05:42:53,510 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-15 05:42:53,510 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-15 05:42:53,510 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-15 05:42:53,510 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-15 05:42:53,511 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-15 05:42:53,511 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-15 05:42:53,511 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-15 05:42:53,511 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-15 05:42:53,512 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-15 05:42:53,512 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-15 05:42:53,512 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-15 05:42:53,513 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-15 05:42:53,513 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-15 05:42:53,513 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-15 05:42:53,513 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-15 05:42:53,514 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-15 05:42:53,514 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-15 05:42:53,514 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-15 05:42:53,514 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-15 05:42:53,515 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-15 05:42:53,515 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-15 05:42:53,516 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-15 05:42:53,516 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-15 05:42:53,516 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-15 05:42:53,516 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-15 05:42:53,516 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-15 05:42:53,516 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-15 05:42:53,516 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-15 05:42:53,517 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-15 05:42:53,519 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-15 05:42:53,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:54,628 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-15 05:42:54,628 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-15 05:42:54,628 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-15 05:42:54,628 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-15 05:42:54,628 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-15 05:42:54,628 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-15 05:42:54,628 INFO L290 TraceCheckUtils]: 280: Hoare triple {32533#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-15 05:42:54,629 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-15 05:42:54,629 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-15 05:42:54,629 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-15 05:42:54,630 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-15 05:42:54,630 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-15 05:42:54,630 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-15 05:42:54,630 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-15 05:42:54,631 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-15 05:42:54,631 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-15 05:42:54,631 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-15 05:42:54,631 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-15 05:42:54,632 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-15 05:42:54,632 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-15 05:42:54,632 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-15 05:42:54,632 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-15 05:42:54,633 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-15 05:42:54,633 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-15 05:42:54,633 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-15 05:42:54,633 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-15 05:42:54,634 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-15 05:42:54,634 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-15 05:42:54,634 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-15 05:42:54,634 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-15 05:42:54,635 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-15 05:42:54,635 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-15 05:42:54,635 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-15 05:42:54,635 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-15 05:42:54,636 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-15 05:42:54,636 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-15 05:42:54,636 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-15 05:42:54,636 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-15 05:42:54,636 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-15 05:42:54,637 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-15 05:42:54,637 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-15 05:42:54,637 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-15 05:42:54,637 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-15 05:42:54,638 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-15 05:42:54,638 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-15 05:42:54,638 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-15 05:42:54,638 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-15 05:42:54,639 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-15 05:42:54,639 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-15 05:42:54,639 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-15 05:42:54,639 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-15 05:42:54,640 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-15 05:42:54,640 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-15 05:42:54,640 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-15 05:42:54,640 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-15 05:42:54,641 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-15 05:42:54,641 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-15 05:42:54,641 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-15 05:42:54,641 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-15 05:42:54,642 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-15 05:42:54,642 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-15 05:42:54,642 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-15 05:42:54,642 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-15 05:42:54,643 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-15 05:42:54,643 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-15 05:42:54,643 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-15 05:42:54,643 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-15 05:42:54,644 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-15 05:42:54,644 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-15 05:42:54,644 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-15 05:42:54,644 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-15 05:42:54,645 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-15 05:42:54,645 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-15 05:42:54,645 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-15 05:42:54,645 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-15 05:42:54,646 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-15 05:42:54,646 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-15 05:42:54,646 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-15 05:42:54,646 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-15 05:42:54,647 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-15 05:42:54,647 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-15 05:42:54,647 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-15 05:42:54,647 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-15 05:42:54,648 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-15 05:42:54,648 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-15 05:42:54,648 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-15 05:42:54,648 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-15 05:42:54,649 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-15 05:42:54,649 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-15 05:42:54,649 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-15 05:42:54,649 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-15 05:42:54,650 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-15 05:42:54,650 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-15 05:42:54,650 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-15 05:42:54,650 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-15 05:42:54,651 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-15 05:42:54,651 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-15 05:42:54,651 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-15 05:42:54,651 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-15 05:42:54,652 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-15 05:42:54,652 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-15 05:42:54,652 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-15 05:42:54,652 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-15 05:42:54,653 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-15 05:42:54,653 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-15 05:42:54,653 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-15 05:42:54,653 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-15 05:42:54,653 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-15 05:42:54,654 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-15 05:42:54,654 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-15 05:42:54,654 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-15 05:42:54,654 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-15 05:42:54,655 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-15 05:42:54,655 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-15 05:42:54,655 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-15 05:42:54,655 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-15 05:42:54,656 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-15 05:42:54,656 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-15 05:42:54,656 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-15 05:42:54,656 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-15 05:42:54,657 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-15 05:42:54,657 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-15 05:42:54,657 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-15 05:42:54,657 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-15 05:42:54,658 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-15 05:42:54,658 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-15 05:42:54,658 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-15 05:42:54,658 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-15 05:42:54,659 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-15 05:42:54,659 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-15 05:42:54,659 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-15 05:42:54,659 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-15 05:42:54,660 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-15 05:42:54,660 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-15 05:42:54,660 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-15 05:42:54,660 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-15 05:42:54,661 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-15 05:42:54,661 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-15 05:42:54,661 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-15 05:42:54,661 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-15 05:42:54,662 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-15 05:42:54,662 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-15 05:42:54,662 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-15 05:42:54,662 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-15 05:42:54,663 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-15 05:42:54,663 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-15 05:42:54,663 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-15 05:42:54,663 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-15 05:42:54,664 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-15 05:42:54,664 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-15 05:42:54,664 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-15 05:42:54,664 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-15 05:42:54,665 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-15 05:42:54,665 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-15 05:42:54,665 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-15 05:42:54,665 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-15 05:42:54,666 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-15 05:42:54,666 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-15 05:42:54,666 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-15 05:42:54,666 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-15 05:42:54,667 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-15 05:42:54,667 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-15 05:42:54,667 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-15 05:42:54,667 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-15 05:42:54,668 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-15 05:42:54,668 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-15 05:42:54,668 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-15 05:42:54,668 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-15 05:42:54,669 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-15 05:42:54,669 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-15 05:42:54,669 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-15 05:42:54,669 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-15 05:42:54,670 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-15 05:42:54,670 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-15 05:42:54,670 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-15 05:42:54,670 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-15 05:42:54,671 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-15 05:42:54,671 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-15 05:42:54,671 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-15 05:42:54,671 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-15 05:42:54,672 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-15 05:42:54,672 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-15 05:42:54,672 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-15 05:42:54,672 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-15 05:42:54,673 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-15 05:42:54,673 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-15 05:42:54,673 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-15 05:42:54,673 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-15 05:42:54,674 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-15 05:42:54,674 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-15 05:42:54,674 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-15 05:42:54,674 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-15 05:42:54,675 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-15 05:42:54,675 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-15 05:42:54,675 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-15 05:42:54,675 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-15 05:42:54,676 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-15 05:42:54,676 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-15 05:42:54,676 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-15 05:42:54,676 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-15 05:42:54,677 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-15 05:42:54,677 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-15 05:42:54,677 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-15 05:42:54,677 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-15 05:42:54,678 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-15 05:42:54,678 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-15 05:42:54,679 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-15 05:42:54,679 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-15 05:42:54,679 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-15 05:42:54,679 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-15 05:42:54,680 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-15 05:42:54,680 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-15 05:42:54,680 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-15 05:42:54,681 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-15 05:42:54,681 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-15 05:42:54,681 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-15 05:42:54,682 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-15 05:42:54,682 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-15 05:42:54,682 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-15 05:42:54,683 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-15 05:42:54,683 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-15 05:42:54,683 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-15 05:42:54,684 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-15 05:42:54,684 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-15 05:42:54,684 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-15 05:42:54,685 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-15 05:42:54,685 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-15 05:42:54,685 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-15 05:42:54,686 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-15 05:42:54,686 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-15 05:42:54,686 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-15 05:42:54,686 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-15 05:42:54,687 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-15 05:42:54,687 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-15 05:42:54,687 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-15 05:42:54,688 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-15 05:42:54,688 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-15 05:42:54,688 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-15 05:42:54,689 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-15 05:42:54,689 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-15 05:42:54,689 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-15 05:42:54,690 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-15 05:42:54,690 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-15 05:42:54,690 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-15 05:42:54,690 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-15 05:42:54,691 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-15 05:42:54,691 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-15 05:42:54,691 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-15 05:42:54,692 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-15 05:42:54,692 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-15 05:42:54,692 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-15 05:42:54,693 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-15 05:42:54,693 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-15 05:42:54,693 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-15 05:42:54,694 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-15 05:42:54,694 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-15 05:42:54,695 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-15 05:42:54,695 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-15 05:42:54,695 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-15 05:42:54,695 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-15 05:42:54,696 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-15 05:42:54,696 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-15 05:42:54,696 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-15 05:42:54,697 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-15 05:42:54,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {31619#true} ~i~0 := 0; {31619#true} is VALID [2022-04-15 05:42:54,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {31619#true} assume !(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:54,697 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-15 05:42:54,697 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-15 05:42:54,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:54,697 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-15 05:42:54,697 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-15 05:42:54,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:54,697 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-15 05:42:54,697 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-15 05:42:54,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:54,697 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-15 05:42:54,698 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-15 05:42:54,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:54,698 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-15 05:42:54,698 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-15 05:42:54,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-15 05:42:54,698 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-15 05:42:54,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-15 05:42:54,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-15 05:42:54,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-15 05:42:54,698 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-15 05:42:54,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-15 05:42:54,699 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-15 05:42:54,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070979679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:54,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:54,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25, 25] total 53 [2022-04-15 05:42:54,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:54,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1449239738] [2022-04-15 05:42:54,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1449239738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:54,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:54,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:42:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697630373] [2022-04-15 05:42:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:54,701 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-15 05:42:54,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:54,701 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-15 05:42:54,731 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-15 05:42:54,731 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:42:54,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:42:54,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 05:42:54,732 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-15 05:42:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:56,617 INFO L93 Difference]: Finished difference Result 406 states and 525 transitions. [2022-04-15 05:42:56,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:42:56,617 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-15 05:42:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:56,618 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-15 05:42:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-04-15 05:42:56,619 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-15 05:42:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-04-15 05:42:56,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 139 transitions. [2022-04-15 05:42:56,723 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-15 05:42:56,729 INFO L225 Difference]: With dead ends: 406 [2022-04-15 05:42:56,729 INFO L226 Difference]: Without dead ends: 390 [2022-04-15 05:42:56,730 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-15 05:42:56,730 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-15 05:42:56,730 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-15 05:42:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-15 05:42:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 355. [2022-04-15 05:42:58,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:58,167 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-15 05:42:58,167 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-15 05:42:58,168 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-15 05:42:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:58,174 INFO L93 Difference]: Finished difference Result 390 states and 507 transitions. [2022-04-15 05:42:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 507 transitions. [2022-04-15 05:42:58,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:58,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:58,175 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-15 05:42:58,175 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-15 05:42:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:58,181 INFO L93 Difference]: Finished difference Result 390 states and 507 transitions. [2022-04-15 05:42:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 507 transitions. [2022-04-15 05:42:58,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:58,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:58,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:58,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:58,182 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-15 05:42:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 464 transitions. [2022-04-15 05:42:58,188 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 464 transitions. Word has length 287 [2022-04-15 05:42:58,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:58,188 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 464 transitions. [2022-04-15 05:42:58,188 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-15 05:42:58,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 464 transitions. [2022-04-15 05:42:59,069 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-15 05:42:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 464 transitions. [2022-04-15 05:42:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2022-04-15 05:42:59,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:59,071 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-15 05:42:59,089 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-15 05:42:59,283 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-15 05:42:59,283 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:59,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash 587258522, now seen corresponding path program 53 times [2022-04-15 05:42:59,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:59,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [147674721] [2022-04-15 05:42:59,291 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:59,291 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:59,291 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:59,291 INFO L85 PathProgramCache]: Analyzing trace with hash 587258522, now seen corresponding path program 54 times [2022-04-15 05:42:59,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:59,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961474314] [2022-04-15 05:42:59,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:59,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:59,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:59,634 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-15 05:42:59,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-15 05:42:59,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-15 05:42:59,635 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-15 05:42:59,635 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-15 05:42:59,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-15 05:42:59,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-15 05:42:59,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-15 05:42:59,637 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-15 05:42:59,638 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-15 05:42:59,638 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-15 05:42:59,638 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-15 05:42:59,639 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-15 05:42:59,639 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-15 05:42:59,639 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-15 05:42:59,639 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-15 05:42:59,640 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-15 05:42:59,640 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-15 05:42:59,640 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-15 05:42:59,641 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-15 05:42:59,641 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-15 05:42:59,641 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-15 05:42:59,641 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-15 05:42:59,642 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-15 05:42:59,642 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-15 05:42:59,642 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-15 05:42:59,643 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-15 05:42:59,643 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-15 05:42:59,643 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-15 05:42:59,643 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-15 05:42:59,644 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-15 05:42:59,644 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-15 05:42:59,644 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-15 05:42:59,645 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-15 05:42:59,645 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-15 05:42:59,645 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-15 05:42:59,645 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-15 05:42:59,646 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-15 05:42:59,646 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-15 05:42:59,646 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-15 05:42:59,646 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-15 05:42:59,647 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-15 05:42:59,647 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-15 05:42:59,647 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-15 05:42:59,648 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-15 05:42:59,648 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-15 05:42:59,648 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-15 05:42:59,648 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-15 05:42:59,649 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-15 05:42:59,649 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-15 05:42:59,649 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-15 05:42:59,649 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-15 05:42:59,650 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-15 05:42:59,650 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-15 05:42:59,650 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-15 05:42:59,650 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-15 05:42:59,651 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-15 05:42:59,651 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-15 05:42:59,651 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-15 05:42:59,652 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-15 05:42:59,652 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-15 05:42:59,652 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-15 05:42:59,652 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-15 05:42:59,653 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-15 05:42:59,653 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-15 05:42:59,653 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-15 05:42:59,653 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-15 05:42:59,654 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-15 05:42:59,654 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-15 05:42:59,654 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-15 05:42:59,654 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-15 05:42:59,655 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-15 05:42:59,655 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-15 05:42:59,655 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-15 05:42:59,656 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-15 05:42:59,656 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-15 05:42:59,656 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-15 05:42:59,656 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-15 05:42:59,657 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-15 05:42:59,657 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-15 05:42:59,657 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-15 05:42:59,657 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-15 05:42:59,658 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-15 05:42:59,658 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-15 05:42:59,658 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-15 05:42:59,659 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-15 05:42:59,659 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-15 05:42:59,659 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-15 05:42:59,659 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-15 05:42:59,660 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-15 05:42:59,660 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-15 05:42:59,660 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-15 05:42:59,660 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-15 05:42:59,661 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-15 05:42:59,661 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-15 05:42:59,661 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-15 05:42:59,661 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-15 05:42:59,662 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-15 05:42:59,662 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-15 05:42:59,662 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-15 05:42:59,663 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-15 05:42:59,663 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-15 05:42:59,663 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-15 05:42:59,663 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-15 05:42:59,664 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-15 05:42:59,664 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-15 05:42:59,664 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-15 05:42:59,664 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-15 05:42:59,665 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-15 05:42:59,665 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-15 05:42:59,665 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-15 05:42:59,665 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-15 05:42:59,666 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-15 05:42:59,666 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-15 05:42:59,666 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-15 05:42:59,667 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-15 05:42:59,667 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-15 05:42:59,667 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-15 05:42:59,667 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-15 05:42:59,668 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-15 05:42:59,668 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-15 05:42:59,668 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-15 05:42:59,668 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-15 05:42:59,669 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-15 05:42:59,669 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-15 05:42:59,669 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-15 05:42:59,669 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-15 05:42:59,670 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-15 05:42:59,670 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-15 05:42:59,670 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-15 05:42:59,671 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-15 05:42:59,671 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-15 05:42:59,671 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-15 05:42:59,671 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-15 05:42:59,672 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-15 05:42:59,672 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-15 05:42:59,672 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-15 05:42:59,673 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-15 05:42:59,673 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-15 05:42:59,673 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-15 05:42:59,673 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-15 05:42:59,674 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-15 05:42:59,674 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-15 05:42:59,674 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-15 05:42:59,674 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-15 05:42:59,675 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-15 05:42:59,675 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-15 05:42:59,675 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-15 05:42:59,675 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-15 05:42:59,676 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-15 05:42:59,676 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-15 05:42:59,676 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-15 05:42:59,677 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-15 05:42:59,677 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-15 05:42:59,677 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-15 05:42:59,677 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-15 05:42:59,678 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-15 05:42:59,678 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-15 05:42:59,678 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-15 05:42:59,678 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-15 05:42:59,679 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-15 05:42:59,679 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-15 05:42:59,679 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-15 05:42:59,679 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-15 05:42:59,680 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-15 05:42:59,680 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-15 05:42:59,680 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-15 05:42:59,681 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-15 05:42:59,681 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-15 05:42:59,681 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-15 05:42:59,681 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-15 05:42:59,682 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-15 05:42:59,682 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-15 05:42:59,682 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-15 05:42:59,682 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-15 05:42:59,683 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-15 05:42:59,683 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-15 05:42:59,683 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-15 05:42:59,683 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-15 05:42:59,684 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-15 05:42:59,684 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-15 05:42:59,684 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-15 05:42:59,685 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-15 05:42:59,685 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-15 05:42:59,685 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-15 05:42:59,686 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-15 05:42:59,686 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-15 05:42:59,686 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-15 05:42:59,686 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-15 05:42:59,687 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-15 05:42:59,687 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-15 05:42:59,687 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-15 05:42:59,687 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-15 05:42:59,688 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-15 05:42:59,688 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-15 05:42:59,688 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-15 05:42:59,688 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-15 05:42:59,689 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-15 05:42:59,689 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-15 05:42:59,689 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-15 05:42:59,690 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-15 05:42:59,690 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-15 05:42:59,690 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-15 05:42:59,690 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-15 05:42:59,691 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-15 05:42:59,691 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-15 05:42:59,691 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-15 05:42:59,691 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-15 05:42:59,692 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-15 05:42:59,692 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-15 05:42:59,692 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-15 05:42:59,692 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-15 05:42:59,693 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-15 05:42:59,693 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-15 05:42:59,693 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-15 05:42:59,694 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-15 05:42:59,694 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-15 05:42:59,694 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-15 05:42:59,694 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-15 05:42:59,695 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-15 05:42:59,695 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-15 05:42:59,695 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-15 05:42:59,695 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-15 05:42:59,696 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-15 05:42:59,696 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-15 05:42:59,696 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-15 05:42:59,697 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-15 05:42:59,697 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-15 05:42:59,697 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-15 05:42:59,697 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-15 05:42:59,698 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-15 05:42:59,698 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-15 05:42:59,698 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-15 05:42:59,698 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-15 05:42:59,699 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-15 05:42:59,699 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-15 05:42:59,699 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-15 05:42:59,700 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-15 05:42:59,700 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-15 05:42:59,700 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-15 05:42:59,700 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-15 05:42:59,701 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-15 05:42:59,701 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-15 05:42:59,701 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-15 05:42:59,701 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-15 05:42:59,702 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-15 05:42:59,702 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-15 05:42:59,702 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-15 05:42:59,703 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-15 05:42:59,703 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-15 05:42:59,703 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-15 05:42:59,703 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-15 05:42:59,704 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-15 05:42:59,704 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-15 05:42:59,704 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-15 05:42:59,704 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-15 05:42:59,705 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-15 05:42:59,705 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-15 05:42:59,705 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-15 05:42:59,706 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-15 05:42:59,706 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-15 05:42:59,706 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-15 05:42:59,706 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-15 05:42:59,707 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-15 05:42:59,707 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-15 05:42:59,707 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-15 05:42:59,707 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-15 05:42:59,708 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-15 05:42:59,708 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-15 05:42:59,708 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-15 05:42:59,709 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-15 05:42:59,709 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-15 05:42:59,709 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-15 05:42:59,709 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-15 05:42:59,710 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-15 05:42:59,710 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-15 05:42:59,710 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-15 05:42:59,710 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-15 05:42:59,711 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-15 05:42:59,711 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-15 05:42:59,711 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-15 05:42:59,712 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-15 05:42:59,712 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-15 05:42:59,712 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-15 05:42:59,712 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-15 05:42:59,713 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-15 05:42:59,713 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-15 05:42:59,713 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-15 05:42:59,713 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-15 05:42:59,714 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-15 05:42:59,714 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-15 05:42:59,714 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-15 05:42:59,715 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-15 05:42:59,715 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-15 05:42:59,715 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-15 05:42:59,715 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-15 05:42:59,716 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-15 05:42:59,716 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-15 05:42:59,716 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-15 05:42:59,716 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-15 05:42:59,717 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-15 05:42:59,717 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-15 05:42:59,717 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-15 05:42:59,718 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-15 05:42:59,718 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-15 05:42:59,718 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-15 05:42:59,718 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-15 05:42:59,719 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-15 05:42:59,719 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-15 05:42:59,719 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-15 05:42:59,719 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-15 05:42:59,720 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-15 05:42:59,720 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-15 05:42:59,720 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-15 05:42:59,721 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-15 05:42:59,721 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-15 05:42:59,721 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-15 05:42:59,721 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-15 05:42:59,722 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-15 05:42:59,722 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-15 05:42:59,722 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-15 05:42:59,722 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-15 05:42:59,723 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-15 05:42:59,723 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-15 05:42:59,723 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-15 05:42:59,724 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-15 05:42:59,724 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-15 05:42:59,724 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-15 05:42:59,724 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-15 05:42:59,725 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-15 05:42:59,725 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-15 05:42:59,725 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-15 05:42:59,725 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-15 05:42:59,726 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-15 05:42:59,726 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-15 05:42:59,726 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-15 05:42:59,726 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-15 05:42:59,727 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-15 05:42:59,727 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-15 05:42:59,727 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-15 05:42:59,728 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-15 05:42:59,728 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-15 05:42:59,728 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-15 05:42:59,729 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-15 05:42:59,729 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-15 05:42:59,730 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-15 05:42:59,730 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-15 05:42:59,730 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-15 05:42:59,730 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-15 05:42:59,730 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-15 05:42:59,730 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-15 05:42:59,730 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-15 05:42:59,731 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-15 05:42:59,732 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-15 05:42:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:59,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961474314] [2022-04-15 05:42:59,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961474314] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:59,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868995973] [2022-04-15 05:42:59,733 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:59,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:59,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:59,748 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-15 05:42:59,755 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-15 05:43:00,126 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:43:00,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:43:00,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:43:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:00,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:01,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35710#true} is VALID [2022-04-15 05:43:01,321 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-15 05:43:01,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-15 05:43:01,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-15 05:43:01,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-15 05:43:01,323 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-15 05:43:01,323 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-15 05:43:01,324 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-15 05:43:01,324 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-15 05:43:01,324 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-15 05:43:01,324 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-15 05:43:01,325 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-15 05:43:01,325 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-15 05:43:01,325 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-15 05:43:01,325 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-15 05:43:01,326 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-15 05:43:01,326 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-15 05:43:01,326 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-15 05:43:01,326 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-15 05:43:01,327 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-15 05:43:01,327 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-15 05:43:01,327 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-15 05:43:01,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {35737#(<= 20 main_~edgecount~0)} ~i~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:43:01,327 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-15 05:43:01,328 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-15 05:43:01,328 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-15 05:43:01,328 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-15 05:43:01,328 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-15 05:43:01,329 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-15 05:43:01,329 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-15 05:43:01,329 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-15 05:43:01,329 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-15 05:43:01,330 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-15 05:43:01,330 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-15 05:43:01,330 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-15 05:43:01,330 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-15 05:43:01,330 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-15 05:43:01,331 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-15 05:43:01,331 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-15 05:43:01,331 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-15 05:43:01,331 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-15 05:43:01,332 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-15 05:43:01,332 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-15 05:43:01,332 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-15 05:43:01,332 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-15 05:43:01,333 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-15 05:43:01,333 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-15 05:43:01,333 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-15 05:43:01,333 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-15 05:43:01,334 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-15 05:43:01,334 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-15 05:43:01,334 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-15 05:43:01,334 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-15 05:43:01,334 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-15 05:43:01,335 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-15 05:43:01,335 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-15 05:43:01,335 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-15 05:43:01,335 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-15 05:43:01,336 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-15 05:43:01,336 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-15 05:43:01,336 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-15 05:43:01,336 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-15 05:43:01,337 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-15 05:43:01,337 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-15 05:43:01,337 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-15 05:43:01,337 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-15 05:43:01,337 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-15 05:43:01,338 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-15 05:43:01,338 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-15 05:43:01,338 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-15 05:43:01,338 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-15 05:43:01,339 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-15 05:43:01,339 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-15 05:43:01,339 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-15 05:43:01,339 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-15 05:43:01,340 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-15 05:43:01,340 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-15 05:43:01,340 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-15 05:43:01,340 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-15 05:43:01,340 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-15 05:43:01,341 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-15 05:43:01,341 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-15 05:43:01,341 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-15 05:43:01,341 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-15 05:43:01,342 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-15 05:43:01,342 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-15 05:43:01,342 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-15 05:43:01,342 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-15 05:43:01,343 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-15 05:43:01,343 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-15 05:43:01,343 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-15 05:43:01,343 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-15 05:43:01,343 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-15 05:43:01,344 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-15 05:43:01,344 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-15 05:43:01,344 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-15 05:43:01,344 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-15 05:43:01,345 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-15 05:43:01,345 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-15 05:43:01,345 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-15 05:43:01,345 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-15 05:43:01,346 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-15 05:43:01,346 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-15 05:43:01,346 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-15 05:43:01,346 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-15 05:43:01,346 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-15 05:43:01,347 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-15 05:43:01,347 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-15 05:43:01,347 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-15 05:43:01,347 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-15 05:43:01,348 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-15 05:43:01,348 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-15 05:43:01,348 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-15 05:43:01,348 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-15 05:43:01,349 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-15 05:43:01,349 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-15 05:43:01,349 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-15 05:43:01,349 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-15 05:43:01,349 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-15 05:43:01,350 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-15 05:43:01,350 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-15 05:43:01,350 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-15 05:43:01,350 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-15 05:43:01,351 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-15 05:43:01,351 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-15 05:43:01,351 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-15 05:43:01,351 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-15 05:43:01,352 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-15 05:43:01,352 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-15 05:43:01,352 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-15 05:43:01,352 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-15 05:43:01,353 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-15 05:43:01,353 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-15 05:43:01,353 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-15 05:43:01,353 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-15 05:43:01,353 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-15 05:43:01,354 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-15 05:43:01,354 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-15 05:43:01,354 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-15 05:43:01,354 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-15 05:43:01,355 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-15 05:43:01,355 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-15 05:43:01,355 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-15 05:43:01,355 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-15 05:43:01,356 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-15 05:43:01,356 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-15 05:43:01,356 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-15 05:43:01,356 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-15 05:43:01,356 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-15 05:43:01,357 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-15 05:43:01,357 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-15 05:43:01,357 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-15 05:43:01,357 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-15 05:43:01,358 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-15 05:43:01,358 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-15 05:43:01,358 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-15 05:43:01,358 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-15 05:43:01,359 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-15 05:43:01,359 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-15 05:43:01,359 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-15 05:43:01,359 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-15 05:43:01,359 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-15 05:43:01,360 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-15 05:43:01,360 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-15 05:43:01,360 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-15 05:43:01,360 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-15 05:43:01,361 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-15 05:43:01,361 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-15 05:43:01,361 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-15 05:43:01,361 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-15 05:43:01,362 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-15 05:43:01,362 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-15 05:43:01,362 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-15 05:43:01,362 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-15 05:43:01,362 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-15 05:43:01,363 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-15 05:43:01,363 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-15 05:43:01,363 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-15 05:43:01,363 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-15 05:43:01,364 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-15 05:43:01,364 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-15 05:43:01,364 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-15 05:43:01,364 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-15 05:43:01,365 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-15 05:43:01,365 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-15 05:43:01,365 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-15 05:43:01,365 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-15 05:43:01,365 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-15 05:43:01,366 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-15 05:43:01,366 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-15 05:43:01,366 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-15 05:43:01,366 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-15 05:43:01,367 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-15 05:43:01,367 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-15 05:43:01,367 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-15 05:43:01,367 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-15 05:43:01,368 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-15 05:43:01,368 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-15 05:43:01,368 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-15 05:43:01,368 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-15 05:43:01,368 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-15 05:43:01,369 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-15 05:43:01,369 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-15 05:43:01,369 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-15 05:43:01,369 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-15 05:43:01,370 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-15 05:43:01,370 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-15 05:43:01,370 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-15 05:43:01,370 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-15 05:43:01,371 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-15 05:43:01,371 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-15 05:43:01,371 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-15 05:43:01,371 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-15 05:43:01,371 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-15 05:43:01,372 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-15 05:43:01,372 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-15 05:43:01,372 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-15 05:43:01,372 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-15 05:43:01,373 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-15 05:43:01,373 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-15 05:43:01,373 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-15 05:43:01,373 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-15 05:43:01,373 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-15 05:43:01,374 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-15 05:43:01,374 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-15 05:43:01,374 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-15 05:43:01,374 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-15 05:43:01,375 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-15 05:43:01,375 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-15 05:43:01,375 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-15 05:43:01,375 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-15 05:43:01,375 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-15 05:43:01,376 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-15 05:43:01,376 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-15 05:43:01,376 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-15 05:43:01,376 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-15 05:43:01,377 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-15 05:43:01,377 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-15 05:43:01,377 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-15 05:43:01,377 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-15 05:43:01,377 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-15 05:43:01,378 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-15 05:43:01,378 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-15 05:43:01,378 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-15 05:43:01,378 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-15 05:43:01,379 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-15 05:43:01,379 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-15 05:43:01,379 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-15 05:43:01,379 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-15 05:43:01,379 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-15 05:43:01,380 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-15 05:43:01,380 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-15 05:43:01,380 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-15 05:43:01,380 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-15 05:43:01,381 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-15 05:43:01,381 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-15 05:43:01,381 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-15 05:43:01,381 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-15 05:43:01,381 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-15 05:43:01,382 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-15 05:43:01,382 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-15 05:43:01,382 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-15 05:43:01,382 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-15 05:43:01,383 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-15 05:43:01,383 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-15 05:43:01,383 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-15 05:43:01,383 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-15 05:43:01,384 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-15 05:43:01,384 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-15 05:43:01,384 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-15 05:43:01,384 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-15 05:43:01,384 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-15 05:43:01,385 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-15 05:43:01,385 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-15 05:43:01,385 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-15 05:43:01,385 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-15 05:43:01,386 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-15 05:43:01,386 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-15 05:43:01,386 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-15 05:43:01,386 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-15 05:43:01,386 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-15 05:43:01,387 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-15 05:43:01,387 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-15 05:43:01,387 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-15 05:43:01,387 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-15 05:43:01,388 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-15 05:43:01,388 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-15 05:43:01,388 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-15 05:43:01,388 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-15 05:43:01,388 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-15 05:43:01,389 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-15 05:43:01,389 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-15 05:43:01,389 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-15 05:43:01,389 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-15 05:43:01,390 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-15 05:43:01,390 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-15 05:43:01,390 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-15 05:43:01,390 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-15 05:43:01,390 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-15 05:43:01,391 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-15 05:43:01,391 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-15 05:43:01,391 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-15 05:43:01,391 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-15 05:43:01,392 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-15 05:43:01,392 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-15 05:43:01,392 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-15 05:43:01,392 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-15 05:43:01,392 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-15 05:43:01,393 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-15 05:43:01,393 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-15 05:43:01,393 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-15 05:43:01,393 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-15 05:43:01,394 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-15 05:43:01,394 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-15 05:43:01,394 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-15 05:43:01,394 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-15 05:43:01,394 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-15 05:43:01,395 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-15 05:43:01,395 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-15 05:43:01,395 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-15 05:43:01,395 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-15 05:43:01,396 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-15 05:43:01,396 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-15 05:43:01,396 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-15 05:43:01,396 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-15 05:43:01,397 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-15 05:43:01,397 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-15 05:43:01,397 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-15 05:43:01,397 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-15 05:43:01,397 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-15 05:43:01,398 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-15 05:43:01,398 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-15 05:43:01,398 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-15 05:43:01,398 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-15 05:43:01,399 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-15 05:43:01,399 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-15 05:43:01,399 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-15 05:43:01,399 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-15 05:43:01,399 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-15 05:43:01,400 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-15 05:43:01,400 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-15 05:43:01,401 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-15 05:43:01,401 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-15 05:43:01,401 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-15 05:43:01,401 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-15 05:43:01,401 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-15 05:43:01,402 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-15 05:43:01,402 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-15 05:43:01,402 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-15 05:43:01,402 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-15 05:43:01,403 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-15 05:43:01,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:02,419 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-15 05:43:02,419 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-15 05:43:02,419 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-15 05:43:02,419 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-15 05:43:02,419 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-15 05:43:02,419 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-15 05:43:02,420 INFO L290 TraceCheckUtils]: 343: Hoare triple {36790#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {35711#false} is VALID [2022-04-15 05:43:02,421 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-15 05:43:02,421 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-15 05:43:02,421 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-15 05:43:02,421 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-15 05:43:02,422 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-15 05:43:02,422 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-15 05:43:02,422 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-15 05:43:02,422 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-15 05:43:02,423 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-15 05:43:02,423 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-15 05:43:02,423 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-15 05:43:02,423 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-15 05:43:02,424 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-15 05:43:02,424 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-15 05:43:02,424 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-15 05:43:02,425 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-15 05:43:02,425 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-15 05:43:02,425 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-15 05:43:02,425 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-15 05:43:02,426 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-15 05:43:02,426 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-15 05:43:02,426 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-15 05:43:02,426 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-15 05:43:02,427 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-15 05:43:02,427 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-15 05:43:02,427 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-15 05:43:02,428 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-15 05:43:02,428 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-15 05:43:02,428 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-15 05:43:02,428 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-15 05:43:02,429 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-15 05:43:02,429 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-15 05:43:02,429 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-15 05:43:02,429 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-15 05:43:02,430 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-15 05:43:02,430 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-15 05:43:02,430 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-15 05:43:02,430 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-15 05:43:02,431 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-15 05:43:02,431 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-15 05:43:02,431 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-15 05:43:02,431 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-15 05:43:02,432 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-15 05:43:02,432 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-15 05:43:02,432 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-15 05:43:02,432 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-15 05:43:02,433 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-15 05:43:02,433 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-15 05:43:02,433 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-15 05:43:02,433 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-15 05:43:02,434 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-15 05:43:02,434 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-15 05:43:02,434 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-15 05:43:02,434 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-15 05:43:02,435 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-15 05:43:02,435 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-15 05:43:02,435 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-15 05:43:02,435 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-15 05:43:02,436 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-15 05:43:02,436 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-15 05:43:02,436 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-15 05:43:02,436 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-15 05:43:02,437 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-15 05:43:02,437 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-15 05:43:02,437 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-15 05:43:02,437 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-15 05:43:02,438 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-15 05:43:02,438 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-15 05:43:02,438 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-15 05:43:02,438 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-15 05:43:02,439 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-15 05:43:02,439 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-15 05:43:02,439 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-15 05:43:02,439 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-15 05:43:02,440 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-15 05:43:02,440 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-15 05:43:02,440 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-15 05:43:02,440 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-15 05:43:02,441 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-15 05:43:02,441 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-15 05:43:02,441 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-15 05:43:02,441 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-15 05:43:02,442 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-15 05:43:02,442 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-15 05:43:02,442 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-15 05:43:02,443 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-15 05:43:02,443 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-15 05:43:02,443 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-15 05:43:02,443 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-15 05:43:02,444 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-15 05:43:02,444 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-15 05:43:02,444 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-15 05:43:02,444 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-15 05:43:02,445 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-15 05:43:02,445 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-15 05:43:02,445 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-15 05:43:02,445 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-15 05:43:02,446 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-15 05:43:02,446 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-15 05:43:02,446 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-15 05:43:02,446 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-15 05:43:02,447 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-15 05:43:02,447 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-15 05:43:02,447 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-15 05:43:02,447 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-15 05:43:02,448 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-15 05:43:02,448 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-15 05:43:02,448 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-15 05:43:02,448 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-15 05:43:02,449 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-15 05:43:02,449 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-15 05:43:02,449 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-15 05:43:02,449 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-15 05:43:02,450 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-15 05:43:02,450 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-15 05:43:02,450 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-15 05:43:02,450 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-15 05:43:02,451 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-15 05:43:02,451 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-15 05:43:02,451 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-15 05:43:02,451 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-15 05:43:02,452 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-15 05:43:02,452 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-15 05:43:02,452 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-15 05:43:02,452 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-15 05:43:02,453 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-15 05:43:02,453 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-15 05:43:02,453 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-15 05:43:02,453 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-15 05:43:02,454 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-15 05:43:02,454 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-15 05:43:02,454 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-15 05:43:02,454 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-15 05:43:02,455 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-15 05:43:02,455 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-15 05:43:02,455 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-15 05:43:02,455 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-15 05:43:02,456 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-15 05:43:02,456 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-15 05:43:02,456 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-15 05:43:02,456 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-15 05:43:02,457 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-15 05:43:02,457 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-15 05:43:02,457 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-15 05:43:02,457 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-15 05:43:02,458 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-15 05:43:02,458 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-15 05:43:02,458 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-15 05:43:02,458 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-15 05:43:02,459 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-15 05:43:02,459 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-15 05:43:02,459 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-15 05:43:02,459 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-15 05:43:02,460 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-15 05:43:02,460 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-15 05:43:02,460 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-15 05:43:02,460 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-15 05:43:02,461 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-15 05:43:02,461 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-15 05:43:02,461 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-15 05:43:02,461 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-15 05:43:02,462 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-15 05:43:02,462 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-15 05:43:02,462 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-15 05:43:02,462 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-15 05:43:02,463 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-15 05:43:02,463 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-15 05:43:02,463 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-15 05:43:02,463 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-15 05:43:02,464 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-15 05:43:02,464 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-15 05:43:02,464 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-15 05:43:02,464 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-15 05:43:02,465 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-15 05:43:02,465 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-15 05:43:02,465 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-15 05:43:02,465 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-15 05:43:02,466 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-15 05:43:02,466 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-15 05:43:02,466 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-15 05:43:02,466 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-15 05:43:02,467 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-15 05:43:02,467 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-15 05:43:02,467 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-15 05:43:02,467 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-15 05:43:02,468 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-15 05:43:02,468 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-15 05:43:02,468 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-15 05:43:02,468 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-15 05:43:02,469 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-15 05:43:02,469 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-15 05:43:02,469 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-15 05:43:02,469 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-15 05:43:02,470 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-15 05:43:02,470 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-15 05:43:02,470 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-15 05:43:02,470 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-15 05:43:02,471 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-15 05:43:02,471 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-15 05:43:02,471 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-15 05:43:02,471 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-15 05:43:02,472 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-15 05:43:02,472 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-15 05:43:02,472 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-15 05:43:02,472 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-15 05:43:02,473 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-15 05:43:02,473 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-15 05:43:02,473 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-15 05:43:02,473 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-15 05:43:02,474 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-15 05:43:02,474 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-15 05:43:02,474 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-15 05:43:02,474 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-15 05:43:02,475 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-15 05:43:02,475 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-15 05:43:02,475 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-15 05:43:02,475 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-15 05:43:02,476 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-15 05:43:02,476 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-15 05:43:02,476 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-15 05:43:02,476 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-15 05:43:02,477 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-15 05:43:02,477 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-15 05:43:02,477 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-15 05:43:02,477 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-15 05:43:02,478 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-15 05:43:02,478 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-15 05:43:02,478 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-15 05:43:02,478 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-15 05:43:02,479 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-15 05:43:02,479 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-15 05:43:02,479 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-15 05:43:02,479 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-15 05:43:02,480 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-15 05:43:02,480 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-15 05:43:02,480 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-15 05:43:02,480 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-15 05:43:02,481 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-15 05:43:02,481 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-15 05:43:02,481 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-15 05:43:02,481 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-15 05:43:02,482 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-15 05:43:02,482 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-15 05:43:02,482 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-15 05:43:02,482 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-15 05:43:02,483 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-15 05:43:02,483 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-15 05:43:02,483 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-15 05:43:02,483 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-15 05:43:02,484 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-15 05:43:02,484 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-15 05:43:02,484 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-15 05:43:02,484 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-15 05:43:02,485 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-15 05:43:02,485 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-15 05:43:02,485 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-15 05:43:02,485 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-15 05:43:02,486 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-15 05:43:02,486 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-15 05:43:02,486 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-15 05:43:02,486 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-15 05:43:02,487 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-15 05:43:02,487 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-15 05:43:02,487 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-15 05:43:02,502 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-15 05:43:02,502 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-15 05:43:02,503 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-15 05:43:02,503 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-15 05:43:02,503 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-15 05:43:02,503 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-15 05:43:02,504 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-15 05:43:02,504 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-15 05:43:02,504 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-15 05:43:02,504 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-15 05:43:02,505 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-15 05:43:02,505 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-15 05:43:02,505 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-15 05:43:02,505 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-15 05:43:02,506 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-15 05:43:02,506 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-15 05:43:02,506 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-15 05:43:02,506 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-15 05:43:02,507 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-15 05:43:02,507 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-15 05:43:02,507 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-15 05:43:02,507 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-15 05:43:02,508 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-15 05:43:02,508 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-15 05:43:02,508 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-15 05:43:02,508 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-15 05:43:02,509 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-15 05:43:02,509 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-15 05:43:02,509 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-15 05:43:02,509 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-15 05:43:02,510 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-15 05:43:02,510 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-15 05:43:02,510 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-15 05:43:02,510 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-15 05:43:02,511 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-15 05:43:02,511 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-15 05:43:02,511 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-15 05:43:02,511 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-15 05:43:02,512 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-15 05:43:02,512 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-15 05:43:02,512 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-15 05:43:02,512 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-15 05:43:02,513 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-15 05:43:02,513 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-15 05:43:02,513 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-15 05:43:02,513 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-15 05:43:02,514 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-15 05:43:02,514 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-15 05:43:02,514 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-15 05:43:02,514 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-15 05:43:02,515 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-15 05:43:02,515 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-15 05:43:02,515 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-15 05:43:02,515 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-15 05:43:02,516 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-15 05:43:02,516 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-15 05:43:02,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {36804#(< 1 main_~edgecount~0)} ~i~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-15 05:43:02,516 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-15 05:43:02,517 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-15 05:43:02,517 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-15 05:43:02,517 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-15 05:43:02,517 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-15 05:43:02,518 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-15 05:43:02,518 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-15 05:43:02,518 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-15 05:43:02,518 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-15 05:43:02,519 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-15 05:43:02,519 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-15 05:43:02,519 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-15 05:43:02,519 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-15 05:43:02,520 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-15 05:43:02,520 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-15 05:43:02,520 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-15 05:43:02,522 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-15 05:43:02,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-15 05:43:02,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-15 05:43:02,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-15 05:43:02,523 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-15 05:43:02,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35710#true} is VALID [2022-04-15 05:43:02,524 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-15 05:43:02,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868995973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:02,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:02,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-15 05:43:02,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:02,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [147674721] [2022-04-15 05:43:02,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [147674721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:02,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:02,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:43:02,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841102318] [2022-04-15 05:43:02,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:02,525 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-15 05:43:02,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:02,525 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-15 05:43:02,571 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-15 05:43:02,571 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:43:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:02,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:43:02,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:43:02,572 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-15 05:43:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:04,156 INFO L93 Difference]: Finished difference Result 379 states and 491 transitions. [2022-04-15 05:43:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:43:04,156 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-15 05:43:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:04,157 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-15 05:43:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-04-15 05:43:04,158 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-15 05:43:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-04-15 05:43:04,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2022-04-15 05:43:04,236 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-15 05:43:04,268 INFO L225 Difference]: With dead ends: 379 [2022-04-15 05:43:04,268 INFO L226 Difference]: Without dead ends: 368 [2022-04-15 05:43:04,269 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-15 05:43:04,269 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-15 05:43:04,269 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-15 05:43:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-15 05:43:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 358. [2022-04-15 05:43:05,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:05,755 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-15 05:43:05,771 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-15 05:43:05,772 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-15 05:43:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:05,777 INFO L93 Difference]: Finished difference Result 368 states and 479 transitions. [2022-04-15 05:43:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 479 transitions. [2022-04-15 05:43:05,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:05,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:05,778 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-15 05:43:05,778 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-15 05:43:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:05,799 INFO L93 Difference]: Finished difference Result 368 states and 479 transitions. [2022-04-15 05:43:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 479 transitions. [2022-04-15 05:43:05,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:05,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:05,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:05,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:05,800 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-15 05:43:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 467 transitions. [2022-04-15 05:43:05,806 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 467 transitions. Word has length 350 [2022-04-15 05:43:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:05,807 INFO L478 AbstractCegarLoop]: Abstraction has 358 states and 467 transitions. [2022-04-15 05:43:05,807 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-15 05:43:05,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 358 states and 467 transitions. [2022-04-15 05:43:06,710 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-15 05:43:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 467 transitions. [2022-04-15 05:43:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-04-15 05:43:06,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:06,712 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-15 05:43:06,754 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-15 05:43:06,931 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-15 05:43:06,931 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1194423610, now seen corresponding path program 55 times [2022-04-15 05:43:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:06,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1714041976] [2022-04-15 05:43:06,935 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:06,935 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:06,935 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1194423610, now seen corresponding path program 56 times [2022-04-15 05:43:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:06,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872560143] [2022-04-15 05:43:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:07,234 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-15 05:43:07,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-15 05:43:07,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-15 05:43:07,235 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-15 05:43:07,235 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-15 05:43:07,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-15 05:43:07,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-15 05:43:07,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-15 05:43:07,237 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-15 05:43:07,237 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-15 05:43:07,237 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-15 05:43:07,237 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-15 05:43:07,237 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-15 05:43:07,238 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-15 05:43:07,238 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-15 05:43:07,238 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-15 05:43:07,238 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-15 05:43:07,239 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-15 05:43:07,239 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-15 05:43:07,239 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-15 05:43:07,239 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-15 05:43:07,240 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-15 05:43:07,240 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-15 05:43:07,240 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-15 05:43:07,240 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-15 05:43:07,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:43:07,241 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-15 05:43:07,241 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-15 05:43:07,241 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-15 05:43:07,242 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-15 05:43:07,242 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-15 05:43:07,242 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-15 05:43:07,242 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-15 05:43:07,242 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-15 05:43:07,243 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-15 05:43:07,243 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-15 05:43:07,243 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-15 05:43:07,243 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-15 05:43:07,244 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-15 05:43:07,244 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-15 05:43:07,244 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-15 05:43:07,244 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-15 05:43:07,245 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-15 05:43:07,245 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-15 05:43:07,245 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-15 05:43:07,245 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-15 05:43:07,246 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-15 05:43:07,246 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-15 05:43:07,246 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-15 05:43:07,246 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-15 05:43:07,246 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-15 05:43:07,247 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-15 05:43:07,247 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-15 05:43:07,247 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-15 05:43:07,247 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-15 05:43:07,248 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-15 05:43:07,248 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-15 05:43:07,248 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-15 05:43:07,248 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-15 05:43:07,248 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-15 05:43:07,249 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-15 05:43:07,249 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-15 05:43:07,249 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-15 05:43:07,249 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-15 05:43:07,249 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-15 05:43:07,250 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-15 05:43:07,250 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-15 05:43:07,250 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-15 05:43:07,250 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-15 05:43:07,251 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-15 05:43:07,251 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-15 05:43:07,251 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-15 05:43:07,251 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-15 05:43:07,251 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-15 05:43:07,252 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-15 05:43:07,252 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-15 05:43:07,252 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-15 05:43:07,252 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-15 05:43:07,253 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-15 05:43:07,253 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-15 05:43:07,253 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-15 05:43:07,253 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-15 05:43:07,253 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-15 05:43:07,254 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-15 05:43:07,254 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-15 05:43:07,254 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-15 05:43:07,254 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-15 05:43:07,255 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-15 05:43:07,255 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-15 05:43:07,255 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-15 05:43:07,255 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-15 05:43:07,255 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-15 05:43:07,256 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-15 05:43:07,256 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-15 05:43:07,256 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-15 05:43:07,256 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-15 05:43:07,257 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-15 05:43:07,257 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-15 05:43:07,257 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-15 05:43:07,257 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-15 05:43:07,257 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-15 05:43:07,258 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-15 05:43:07,258 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-15 05:43:07,258 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-15 05:43:07,258 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-15 05:43:07,259 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-15 05:43:07,259 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-15 05:43:07,259 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-15 05:43:07,259 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-15 05:43:07,259 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-15 05:43:07,260 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-15 05:43:07,260 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-15 05:43:07,260 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-15 05:43:07,260 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-15 05:43:07,261 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-15 05:43:07,261 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-15 05:43:07,261 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-15 05:43:07,261 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-15 05:43:07,261 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-15 05:43:07,262 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-15 05:43:07,262 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-15 05:43:07,262 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-15 05:43:07,262 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-15 05:43:07,263 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-15 05:43:07,263 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-15 05:43:07,263 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-15 05:43:07,263 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-15 05:43:07,263 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-15 05:43:07,264 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-15 05:43:07,264 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-15 05:43:07,264 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-15 05:43:07,264 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-15 05:43:07,265 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-15 05:43:07,265 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-15 05:43:07,265 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-15 05:43:07,265 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-15 05:43:07,265 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-15 05:43:07,266 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-15 05:43:07,266 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-15 05:43:07,266 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-15 05:43:07,266 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-15 05:43:07,267 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-15 05:43:07,267 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-15 05:43:07,267 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-15 05:43:07,267 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-15 05:43:07,267 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-15 05:43:07,268 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-15 05:43:07,268 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-15 05:43:07,268 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-15 05:43:07,268 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-15 05:43:07,269 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-15 05:43:07,269 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-15 05:43:07,269 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-15 05:43:07,269 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-15 05:43:07,269 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-15 05:43:07,270 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-15 05:43:07,270 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-15 05:43:07,270 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-15 05:43:07,270 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-15 05:43:07,271 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-15 05:43:07,271 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-15 05:43:07,271 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-15 05:43:07,271 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-15 05:43:07,272 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-15 05:43:07,272 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-15 05:43:07,272 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-15 05:43:07,272 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-15 05:43:07,273 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-15 05:43:07,273 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-15 05:43:07,273 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-15 05:43:07,273 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-15 05:43:07,274 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-15 05:43:07,274 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-15 05:43:07,274 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-15 05:43:07,274 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-15 05:43:07,275 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-15 05:43:07,275 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-15 05:43:07,275 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-15 05:43:07,275 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-15 05:43:07,276 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-15 05:43:07,276 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-15 05:43:07,276 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-15 05:43:07,276 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-15 05:43:07,277 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-15 05:43:07,277 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-15 05:43:07,277 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-15 05:43:07,277 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-15 05:43:07,278 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-15 05:43:07,278 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-15 05:43:07,278 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-15 05:43:07,278 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-15 05:43:07,279 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-15 05:43:07,279 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-15 05:43:07,279 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-15 05:43:07,279 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-15 05:43:07,280 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-15 05:43:07,280 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-15 05:43:07,280 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-15 05:43:07,280 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-15 05:43:07,281 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-15 05:43:07,281 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-15 05:43:07,281 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-15 05:43:07,281 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-15 05:43:07,282 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-15 05:43:07,282 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-15 05:43:07,282 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-15 05:43:07,282 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-15 05:43:07,283 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-15 05:43:07,283 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-15 05:43:07,283 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-15 05:43:07,283 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-15 05:43:07,284 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-15 05:43:07,284 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-15 05:43:07,284 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-15 05:43:07,284 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-15 05:43:07,285 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-15 05:43:07,285 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-15 05:43:07,285 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-15 05:43:07,285 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-15 05:43:07,286 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-15 05:43:07,286 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-15 05:43:07,286 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-15 05:43:07,286 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-15 05:43:07,287 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-15 05:43:07,287 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-15 05:43:07,287 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-15 05:43:07,287 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-15 05:43:07,288 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-15 05:43:07,288 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-15 05:43:07,288 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-15 05:43:07,288 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-15 05:43:07,289 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-15 05:43:07,289 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-15 05:43:07,289 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-15 05:43:07,289 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-15 05:43:07,290 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-15 05:43:07,290 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-15 05:43:07,290 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-15 05:43:07,290 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-15 05:43:07,291 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-15 05:43:07,291 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-15 05:43:07,291 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-15 05:43:07,291 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-15 05:43:07,292 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-15 05:43:07,292 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-15 05:43:07,292 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-15 05:43:07,292 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-15 05:43:07,293 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-15 05:43:07,293 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-15 05:43:07,293 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-15 05:43:07,293 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-15 05:43:07,294 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-15 05:43:07,294 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-15 05:43:07,294 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-15 05:43:07,294 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-15 05:43:07,295 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-15 05:43:07,295 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-15 05:43:07,295 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-15 05:43:07,295 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-15 05:43:07,296 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-15 05:43:07,296 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-15 05:43:07,296 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-15 05:43:07,296 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-15 05:43:07,297 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-15 05:43:07,297 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-15 05:43:07,297 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-15 05:43:07,297 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-15 05:43:07,298 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-15 05:43:07,298 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-15 05:43:07,298 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-15 05:43:07,298 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-15 05:43:07,299 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-15 05:43:07,311 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-15 05:43:07,312 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-15 05:43:07,312 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-15 05:43:07,312 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-15 05:43:07,312 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-15 05:43:07,313 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-15 05:43:07,313 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-15 05:43:07,313 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-15 05:43:07,314 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-15 05:43:07,314 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-15 05:43:07,314 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-15 05:43:07,315 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-15 05:43:07,315 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-15 05:43:07,315 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-15 05:43:07,315 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-15 05:43:07,316 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-15 05:43:07,316 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-15 05:43:07,316 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-15 05:43:07,317 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-15 05:43:07,317 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-15 05:43:07,317 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-15 05:43:07,318 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-15 05:43:07,318 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-15 05:43:07,318 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-15 05:43:07,318 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-15 05:43:07,319 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-15 05:43:07,319 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-15 05:43:07,319 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-15 05:43:07,320 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-15 05:43:07,320 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-15 05:43:07,320 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-15 05:43:07,320 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-15 05:43:07,321 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-15 05:43:07,321 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-15 05:43:07,321 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-15 05:43:07,322 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-15 05:43:07,322 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-15 05:43:07,322 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-15 05:43:07,323 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-15 05:43:07,323 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-15 05:43:07,323 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-15 05:43:07,323 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-15 05:43:07,324 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-15 05:43:07,324 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-15 05:43:07,324 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-15 05:43:07,325 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-15 05:43:07,325 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-15 05:43:07,325 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-15 05:43:07,325 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-15 05:43:07,326 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-15 05:43:07,326 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-15 05:43:07,326 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-15 05:43:07,326 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-15 05:43:07,327 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-15 05:43:07,327 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-15 05:43:07,327 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-15 05:43:07,327 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-15 05:43:07,328 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-15 05:43:07,328 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-15 05:43:07,328 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-15 05:43:07,329 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-15 05:43:07,329 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-15 05:43:07,329 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-15 05:43:07,329 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-15 05:43:07,330 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-15 05:43:07,330 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-15 05:43:07,330 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-15 05:43:07,330 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-15 05:43:07,331 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-15 05:43:07,331 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-15 05:43:07,331 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-15 05:43:07,332 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-15 05:43:07,332 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-15 05:43:07,333 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-15 05:43:07,333 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-15 05:43:07,333 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-15 05:43:07,334 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-15 05:43:07,334 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-15 05:43:07,334 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-15 05:43:07,334 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-15 05:43:07,334 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-15 05:43:07,334 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-15 05:43:07,334 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-15 05:43:07,334 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-15 05:43:07,335 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-15 05:43:07,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:07,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872560143] [2022-04-15 05:43:07,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872560143] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:07,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673417848] [2022-04-15 05:43:07,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:43:07,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:07,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:07,337 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-15 05:43:07,338 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-15 05:43:07,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:43:07,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:43:07,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 2151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:43:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:07,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:09,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40040#true} is VALID [2022-04-15 05:43:09,079 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-15 05:43:09,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-15 05:43:09,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-15 05:43:09,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-15 05:43:09,081 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-15 05:43:09,082 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-15 05:43:09,082 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-15 05:43:09,082 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-15 05:43:09,083 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-15 05:43:09,083 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-15 05:43:09,083 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-15 05:43:09,083 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-15 05:43:09,084 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-15 05:43:09,084 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-15 05:43:09,084 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-15 05:43:09,085 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-15 05:43:09,085 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-15 05:43:09,085 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-15 05:43:09,085 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-15 05:43:09,086 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-15 05:43:09,086 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-15 05:43:09,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:43:09,086 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-15 05:43:09,087 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-15 05:43:09,087 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-15 05:43:09,087 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-15 05:43:09,088 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-15 05:43:09,088 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-15 05:43:09,088 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-15 05:43:09,088 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-15 05:43:09,089 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-15 05:43:09,089 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-15 05:43:09,089 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-15 05:43:09,089 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-15 05:43:09,090 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-15 05:43:09,090 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-15 05:43:09,090 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-15 05:43:09,090 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-15 05:43:09,091 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-15 05:43:09,091 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-15 05:43:09,091 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-15 05:43:09,091 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-15 05:43:09,092 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-15 05:43:09,092 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-15 05:43:09,092 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-15 05:43:09,092 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-15 05:43:09,093 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-15 05:43:09,093 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-15 05:43:09,093 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-15 05:43:09,094 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-15 05:43:09,094 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-15 05:43:09,094 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-15 05:43:09,095 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-15 05:43:09,095 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-15 05:43:09,095 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-15 05:43:09,095 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-15 05:43:09,096 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-15 05:43:09,096 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-15 05:43:09,096 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-15 05:43:09,097 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-15 05:43:09,097 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-15 05:43:09,097 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-15 05:43:09,097 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-15 05:43:09,098 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-15 05:43:09,098 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-15 05:43:09,098 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-15 05:43:09,099 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-15 05:43:09,099 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-15 05:43:09,099 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-15 05:43:09,099 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-15 05:43:09,100 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-15 05:43:09,100 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-15 05:43:09,100 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-15 05:43:09,101 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-15 05:43:09,101 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-15 05:43:09,101 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-15 05:43:09,101 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-15 05:43:09,102 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-15 05:43:09,102 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-15 05:43:09,102 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-15 05:43:09,103 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-15 05:43:09,103 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-15 05:43:09,103 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-15 05:43:09,103 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-15 05:43:09,104 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-15 05:43:09,104 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-15 05:43:09,104 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-15 05:43:09,104 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-15 05:43:09,105 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-15 05:43:09,105 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-15 05:43:09,105 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-15 05:43:09,106 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-15 05:43:09,106 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-15 05:43:09,106 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-15 05:43:09,106 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-15 05:43:09,107 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-15 05:43:09,107 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-15 05:43:09,107 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-15 05:43:09,107 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-15 05:43:09,108 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-15 05:43:09,108 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-15 05:43:09,108 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-15 05:43:09,109 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-15 05:43:09,109 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-15 05:43:09,109 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-15 05:43:09,109 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-15 05:43:09,110 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-15 05:43:09,110 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-15 05:43:09,110 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-15 05:43:09,111 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-15 05:43:09,111 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-15 05:43:09,111 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-15 05:43:09,111 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-15 05:43:09,112 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-15 05:43:09,112 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-15 05:43:09,112 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-15 05:43:09,113 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-15 05:43:09,113 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-15 05:43:09,113 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-15 05:43:09,113 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-15 05:43:09,114 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-15 05:43:09,114 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-15 05:43:09,114 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-15 05:43:09,115 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-15 05:43:09,115 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-15 05:43:09,115 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-15 05:43:09,115 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-15 05:43:09,135 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-15 05:43:09,135 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-15 05:43:09,135 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-15 05:43:09,136 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-15 05:43:09,136 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-15 05:43:09,136 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-15 05:43:09,136 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-15 05:43:09,137 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-15 05:43:09,137 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-15 05:43:09,137 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-15 05:43:09,137 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-15 05:43:09,138 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-15 05:43:09,138 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-15 05:43:09,138 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-15 05:43:09,138 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-15 05:43:09,139 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-15 05:43:09,139 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-15 05:43:09,139 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-15 05:43:09,139 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-15 05:43:09,140 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-15 05:43:09,140 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-15 05:43:09,140 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-15 05:43:09,140 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-15 05:43:09,141 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-15 05:43:09,141 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-15 05:43:09,141 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-15 05:43:09,141 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-15 05:43:09,142 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-15 05:43:09,142 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-15 05:43:09,142 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-15 05:43:09,142 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-15 05:43:09,143 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-15 05:43:09,143 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-15 05:43:09,143 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-15 05:43:09,143 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-15 05:43:09,144 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-15 05:43:09,144 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-15 05:43:09,144 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-15 05:43:09,145 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-15 05:43:09,145 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-15 05:43:09,145 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-15 05:43:09,145 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-15 05:43:09,146 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-15 05:43:09,146 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-15 05:43:09,146 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-15 05:43:09,146 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-15 05:43:09,147 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-15 05:43:09,147 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-15 05:43:09,147 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-15 05:43:09,147 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-15 05:43:09,148 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-15 05:43:09,148 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-15 05:43:09,148 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-15 05:43:09,148 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-15 05:43:09,149 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-15 05:43:09,149 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-15 05:43:09,149 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-15 05:43:09,149 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-15 05:43:09,150 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-15 05:43:09,150 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-15 05:43:09,150 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-15 05:43:09,150 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-15 05:43:09,151 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-15 05:43:09,151 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-15 05:43:09,151 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-15 05:43:09,151 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-15 05:43:09,152 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-15 05:43:09,152 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-15 05:43:09,152 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-15 05:43:09,152 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-15 05:43:09,153 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-15 05:43:09,153 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-15 05:43:09,153 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-15 05:43:09,153 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-15 05:43:09,154 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-15 05:43:09,154 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-15 05:43:09,154 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-15 05:43:09,154 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-15 05:43:09,155 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-15 05:43:09,155 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-15 05:43:09,155 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-15 05:43:09,155 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-15 05:43:09,156 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-15 05:43:09,156 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-15 05:43:09,156 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-15 05:43:09,156 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-15 05:43:09,157 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-15 05:43:09,157 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-15 05:43:09,157 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-15 05:43:09,158 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-15 05:43:09,158 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-15 05:43:09,158 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-15 05:43:09,158 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-15 05:43:09,159 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-15 05:43:09,159 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-15 05:43:09,159 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-15 05:43:09,160 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-15 05:43:09,160 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-15 05:43:09,160 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-15 05:43:09,160 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-15 05:43:09,161 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-15 05:43:09,161 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-15 05:43:09,161 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-15 05:43:09,161 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-15 05:43:09,162 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-15 05:43:09,162 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-15 05:43:09,162 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-15 05:43:09,163 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-15 05:43:09,163 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-15 05:43:09,163 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-15 05:43:09,163 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-15 05:43:09,164 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-15 05:43:09,164 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-15 05:43:09,164 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-15 05:43:09,164 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-15 05:43:09,165 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-15 05:43:09,165 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-15 05:43:09,165 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-15 05:43:09,166 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-15 05:43:09,166 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-15 05:43:09,166 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-15 05:43:09,166 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-15 05:43:09,167 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-15 05:43:09,167 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-15 05:43:09,167 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-15 05:43:09,167 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-15 05:43:09,168 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-15 05:43:09,168 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-15 05:43:09,168 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-15 05:43:09,168 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-15 05:43:09,169 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-15 05:43:09,169 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-15 05:43:09,169 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-15 05:43:09,170 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-15 05:43:09,170 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-15 05:43:09,170 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-15 05:43:09,170 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-15 05:43:09,171 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-15 05:43:09,171 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-15 05:43:09,171 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-15 05:43:09,171 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-15 05:43:09,172 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-15 05:43:09,172 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-15 05:43:09,172 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-15 05:43:09,173 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-15 05:43:09,173 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-15 05:43:09,173 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-15 05:43:09,173 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-15 05:43:09,174 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-15 05:43:09,174 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-15 05:43:09,174 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-15 05:43:09,174 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-15 05:43:09,175 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-15 05:43:09,175 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-15 05:43:09,175 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-15 05:43:09,176 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-15 05:43:09,176 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-15 05:43:09,176 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-15 05:43:09,176 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-15 05:43:09,177 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-15 05:43:09,177 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-15 05:43:09,177 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-15 05:43:09,177 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-15 05:43:09,178 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-15 05:43:09,178 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-15 05:43:09,178 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-15 05:43:09,178 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-15 05:43:09,179 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-15 05:43:09,179 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-15 05:43:09,179 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-15 05:43:09,180 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-15 05:43:09,180 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-15 05:43:09,180 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-15 05:43:09,180 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-15 05:43:09,181 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-15 05:43:09,181 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-15 05:43:09,181 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-15 05:43:09,181 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-15 05:43:09,182 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-15 05:43:09,182 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-15 05:43:09,182 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-15 05:43:09,182 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-15 05:43:09,183 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-15 05:43:09,183 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-15 05:43:09,183 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-15 05:43:09,184 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-15 05:43:09,184 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-15 05:43:09,184 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-15 05:43:09,184 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-15 05:43:09,185 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-15 05:43:09,185 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-15 05:43:09,185 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-15 05:43:09,185 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-15 05:43:09,186 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-15 05:43:09,186 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-15 05:43:09,186 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-15 05:43:09,186 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-15 05:43:09,187 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-15 05:43:09,187 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-15 05:43:09,187 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-15 05:43:09,188 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-15 05:43:09,188 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-15 05:43:09,188 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-15 05:43:09,188 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-15 05:43:09,189 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-15 05:43:09,189 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-15 05:43:09,189 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-15 05:43:09,189 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-15 05:43:09,190 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-15 05:43:09,190 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-15 05:43:09,190 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-15 05:43:09,191 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-15 05:43:09,191 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-15 05:43:09,192 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-15 05:43:09,192 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-15 05:43:09,193 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-15 05:43:09,193 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-15 05:43:09,193 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-15 05:43:09,194 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-15 05:43:09,194 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-15 05:43:09,194 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-15 05:43:09,194 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-15 05:43:09,194 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-15 05:43:09,194 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-15 05:43:09,194 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-15 05:43:09,195 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-15 05:43:09,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:10,301 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-15 05:43:10,301 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-15 05:43:10,301 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-15 05:43:10,301 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-15 05:43:10,301 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-15 05:43:10,301 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-15 05:43:10,301 INFO L290 TraceCheckUtils]: 346: Hoare triple {41130#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {40041#false} is VALID [2022-04-15 05:43:10,302 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-15 05:43:10,302 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-15 05:43:10,302 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-15 05:43:10,303 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-15 05:43:10,303 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-15 05:43:10,303 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-15 05:43:10,304 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-15 05:43:10,304 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-15 05:43:10,304 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-15 05:43:10,305 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-15 05:43:10,305 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-15 05:43:10,305 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-15 05:43:10,305 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-15 05:43:10,306 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-15 05:43:10,306 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-15 05:43:10,306 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-15 05:43:10,307 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-15 05:43:10,307 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-15 05:43:10,307 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-15 05:43:10,307 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-15 05:43:10,308 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-15 05:43:10,308 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-15 05:43:10,308 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-15 05:43:10,309 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-15 05:43:10,309 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-15 05:43:10,309 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-15 05:43:10,309 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-15 05:43:10,310 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-15 05:43:10,310 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-15 05:43:10,310 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-15 05:43:10,310 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-15 05:43:10,311 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-15 05:43:10,311 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-15 05:43:10,311 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-15 05:43:10,312 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-15 05:43:10,312 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-15 05:43:10,312 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-15 05:43:10,312 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-15 05:43:10,313 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-15 05:43:10,313 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-15 05:43:10,313 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-15 05:43:10,314 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-15 05:43:10,314 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-15 05:43:10,314 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-15 05:43:10,314 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-15 05:43:10,315 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-15 05:43:10,315 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-15 05:43:10,315 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-15 05:43:10,316 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-15 05:43:10,316 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-15 05:43:10,316 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-15 05:43:10,316 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-15 05:43:10,317 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-15 05:43:10,317 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-15 05:43:10,317 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-15 05:43:10,318 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-15 05:43:10,318 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-15 05:43:10,318 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-15 05:43:10,318 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-15 05:43:10,319 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-15 05:43:10,319 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-15 05:43:10,319 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-15 05:43:10,319 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-15 05:43:10,320 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-15 05:43:10,320 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-15 05:43:10,320 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-15 05:43:10,321 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-15 05:43:10,321 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-15 05:43:10,321 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-15 05:43:10,321 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-15 05:43:10,322 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-15 05:43:10,322 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-15 05:43:10,322 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-15 05:43:10,323 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-15 05:43:10,323 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-15 05:43:10,323 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-15 05:43:10,323 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-15 05:43:10,324 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-15 05:43:10,324 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-15 05:43:10,324 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-15 05:43:10,324 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-15 05:43:10,325 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-15 05:43:10,325 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-15 05:43:10,325 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-15 05:43:10,326 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-15 05:43:10,326 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-15 05:43:10,326 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-15 05:43:10,326 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-15 05:43:10,327 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-15 05:43:10,327 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-15 05:43:10,327 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-15 05:43:10,327 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-15 05:43:10,328 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-15 05:43:10,328 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-15 05:43:10,328 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-15 05:43:10,329 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-15 05:43:10,329 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-15 05:43:10,329 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-15 05:43:10,329 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-15 05:43:10,330 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-15 05:43:10,330 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-15 05:43:10,330 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-15 05:43:10,330 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-15 05:43:10,331 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-15 05:43:10,331 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-15 05:43:10,331 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-15 05:43:10,332 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-15 05:43:10,332 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-15 05:43:10,332 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-15 05:43:10,332 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-15 05:43:10,333 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-15 05:43:10,333 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-15 05:43:10,333 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-15 05:43:10,333 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-15 05:43:10,334 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-15 05:43:10,334 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-15 05:43:10,334 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-15 05:43:10,334 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-15 05:43:10,335 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-15 05:43:10,335 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-15 05:43:10,335 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-15 05:43:10,335 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-15 05:43:10,336 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-15 05:43:10,336 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-15 05:43:10,336 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-15 05:43:10,336 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-15 05:43:10,337 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-15 05:43:10,337 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-15 05:43:10,337 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-15 05:43:10,337 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-15 05:43:10,338 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-15 05:43:10,338 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-15 05:43:10,338 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-15 05:43:10,339 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-15 05:43:10,339 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-15 05:43:10,339 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-15 05:43:10,339 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-15 05:43:10,340 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-15 05:43:10,340 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-15 05:43:10,340 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-15 05:43:10,340 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-15 05:43:10,341 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-15 05:43:10,341 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-15 05:43:10,341 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-15 05:43:10,342 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-15 05:43:10,342 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-15 05:43:10,342 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-15 05:43:10,342 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-15 05:43:10,343 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-15 05:43:10,343 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-15 05:43:10,343 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-15 05:43:10,343 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-15 05:43:10,344 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-15 05:43:10,344 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-15 05:43:10,344 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-15 05:43:10,345 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-15 05:43:10,345 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-15 05:43:10,345 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-15 05:43:10,345 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-15 05:43:10,346 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-15 05:43:10,346 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-15 05:43:10,346 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-15 05:43:10,346 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-15 05:43:10,347 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-15 05:43:10,347 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-15 05:43:10,347 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-15 05:43:10,348 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-15 05:43:10,348 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-15 05:43:10,348 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-15 05:43:10,348 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-15 05:43:10,349 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-15 05:43:10,349 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-15 05:43:10,349 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-15 05:43:10,349 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-15 05:43:10,350 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-15 05:43:10,350 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-15 05:43:10,350 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-15 05:43:10,350 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-15 05:43:10,351 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-15 05:43:10,351 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-15 05:43:10,351 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-15 05:43:10,352 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-15 05:43:10,352 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-15 05:43:10,352 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-15 05:43:10,352 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-15 05:43:10,353 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-15 05:43:10,353 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-15 05:43:10,353 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-15 05:43:10,354 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-15 05:43:10,354 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-15 05:43:10,354 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-15 05:43:10,354 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-15 05:43:10,355 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-15 05:43:10,355 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-15 05:43:10,355 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-15 05:43:10,356 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-15 05:43:10,356 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-15 05:43:10,356 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-15 05:43:10,356 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-15 05:43:10,357 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-15 05:43:10,357 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-15 05:43:10,357 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-15 05:43:10,357 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-15 05:43:10,358 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-15 05:43:10,358 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-15 05:43:10,358 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-15 05:43:10,359 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-15 05:43:10,359 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-15 05:43:10,359 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-15 05:43:10,359 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-15 05:43:10,360 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-15 05:43:10,360 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-15 05:43:10,360 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-15 05:43:10,360 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-15 05:43:10,361 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-15 05:43:10,361 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-15 05:43:10,361 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-15 05:43:10,362 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-15 05:43:10,362 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-15 05:43:10,362 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-15 05:43:10,362 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-15 05:43:10,363 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-15 05:43:10,363 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-15 05:43:10,363 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-15 05:43:10,363 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-15 05:43:10,364 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-15 05:43:10,364 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-15 05:43:10,364 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-15 05:43:10,364 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-15 05:43:10,365 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-15 05:43:10,365 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-15 05:43:10,365 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-15 05:43:10,366 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-15 05:43:10,366 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-15 05:43:10,366 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-15 05:43:10,367 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-15 05:43:10,367 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-15 05:43:10,367 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-15 05:43:10,367 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-15 05:43:10,368 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-15 05:43:10,368 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-15 05:43:10,368 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-15 05:43:10,368 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-15 05:43:10,369 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-15 05:43:10,369 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-15 05:43:10,369 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-15 05:43:10,370 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-15 05:43:10,370 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-15 05:43:10,370 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-15 05:43:10,370 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-15 05:43:10,371 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-15 05:43:10,371 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-15 05:43:10,371 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-15 05:43:10,372 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-15 05:43:10,372 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-15 05:43:10,372 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-15 05:43:10,372 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-15 05:43:10,373 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-15 05:43:10,373 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-15 05:43:10,373 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-15 05:43:10,373 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-15 05:43:10,374 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-15 05:43:10,374 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-15 05:43:10,374 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-15 05:43:10,375 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-15 05:43:10,375 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-15 05:43:10,375 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-15 05:43:10,375 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-15 05:43:10,376 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-15 05:43:10,376 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-15 05:43:10,376 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-15 05:43:10,377 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-15 05:43:10,377 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-15 05:43:10,377 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-15 05:43:10,377 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-15 05:43:10,378 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-15 05:43:10,378 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-15 05:43:10,378 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-15 05:43:10,378 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-15 05:43:10,379 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-15 05:43:10,379 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-15 05:43:10,379 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-15 05:43:10,379 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-15 05:43:10,380 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-15 05:43:10,380 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-15 05:43:10,380 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-15 05:43:10,381 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-15 05:43:10,381 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-15 05:43:10,381 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-15 05:43:10,381 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-15 05:43:10,382 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-15 05:43:10,382 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-15 05:43:10,382 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-15 05:43:10,383 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-15 05:43:10,383 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-15 05:43:10,383 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-15 05:43:10,383 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-15 05:43:10,384 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-15 05:43:10,384 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-15 05:43:10,384 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-15 05:43:10,384 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-15 05:43:10,385 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-15 05:43:10,385 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-15 05:43:10,385 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-15 05:43:10,386 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-15 05:43:10,386 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-15 05:43:10,386 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-15 05:43:10,386 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-15 05:43:10,387 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-15 05:43:10,387 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-15 05:43:10,387 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-15 05:43:10,387 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-15 05:43:10,388 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-15 05:43:10,388 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-15 05:43:10,388 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-15 05:43:10,388 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-15 05:43:10,389 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-15 05:43:10,389 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-15 05:43:10,389 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-15 05:43:10,389 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-15 05:43:10,390 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-15 05:43:10,390 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-15 05:43:10,390 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-15 05:43:10,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {41154#(< 2 main_~edgecount~0)} ~i~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-15 05:43:10,391 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-15 05:43:10,391 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-15 05:43:10,391 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-15 05:43:10,391 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-15 05:43:10,392 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-15 05:43:10,392 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-15 05:43:10,392 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-15 05:43:10,392 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-15 05:43:10,393 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-15 05:43:10,393 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-15 05:43:10,393 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-15 05:43:10,393 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-15 05:43:10,394 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-15 05:43:10,394 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-15 05:43:10,394 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-15 05:43:10,394 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-15 05:43:10,396 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-15 05:43:10,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-15 05:43:10,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-15 05:43:10,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-15 05:43:10,396 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-15 05:43:10,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40040#true} is VALID [2022-04-15 05:43:10,397 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-15 05:43:10,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673417848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:10,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:10,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-04-15 05:43:10,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:10,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1714041976] [2022-04-15 05:43:10,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1714041976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:10,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:10,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:43:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840622403] [2022-04-15 05:43:10,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:10,398 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-15 05:43:10,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:10,399 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-15 05:43:10,421 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-15 05:43:10,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:43:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:10,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:43:10,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:43:10,422 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-15 05:43:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:12,128 INFO L93 Difference]: Finished difference Result 386 states and 499 transitions. [2022-04-15 05:43:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:43:12,128 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-15 05:43:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:12,128 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-15 05:43:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-15 05:43:12,129 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-15 05:43:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-15 05:43:12,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-15 05:43:12,212 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-15 05:43:12,218 INFO L225 Difference]: With dead ends: 386 [2022-04-15 05:43:12,218 INFO L226 Difference]: Without dead ends: 375 [2022-04-15 05:43:12,218 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-15 05:43:12,218 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-15 05:43:12,218 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-15 05:43:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-15 05:43:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 361. [2022-04-15 05:43:13,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:13,760 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-15 05:43:13,760 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-15 05:43:13,761 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-15 05:43:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:13,768 INFO L93 Difference]: Finished difference Result 375 states and 487 transitions. [2022-04-15 05:43:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 487 transitions. [2022-04-15 05:43:13,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:13,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:13,769 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-15 05:43:13,769 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-15 05:43:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:13,775 INFO L93 Difference]: Finished difference Result 375 states and 487 transitions. [2022-04-15 05:43:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 487 transitions. [2022-04-15 05:43:13,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:13,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:13,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:13,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:13,775 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-15 05:43:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 470 transitions. [2022-04-15 05:43:13,782 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 470 transitions. Word has length 353 [2022-04-15 05:43:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:13,782 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 470 transitions. [2022-04-15 05:43:13,782 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-15 05:43:13,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 470 transitions. [2022-04-15 05:43:14,602 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-15 05:43:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 470 transitions. [2022-04-15 05:43:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2022-04-15 05:43:14,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:14,605 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-15 05:43:14,651 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-15 05:43:14,815 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-15 05:43:14,815 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:14,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1152690534, now seen corresponding path program 57 times [2022-04-15 05:43:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:14,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [280995332] [2022-04-15 05:43:14,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:14,819 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:14,819 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1152690534, now seen corresponding path program 58 times [2022-04-15 05:43:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:14,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713065969] [2022-04-15 05:43:14,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:14,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:15,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:15,145 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-15 05:43:15,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-15 05:43:15,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-15 05:43:15,146 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-15 05:43:15,146 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-15 05:43:15,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-15 05:43:15,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-15 05:43:15,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-15 05:43:15,147 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-15 05:43:15,148 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-15 05:43:15,148 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-15 05:43:15,148 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-15 05:43:15,149 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-15 05:43:15,149 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-15 05:43:15,149 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-15 05:43:15,149 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-15 05:43:15,150 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-15 05:43:15,150 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-15 05:43:15,150 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-15 05:43:15,151 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-15 05:43:15,151 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-15 05:43:15,151 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-15 05:43:15,151 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-15 05:43:15,152 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-15 05:43:15,152 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-15 05:43:15,152 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-15 05:43:15,152 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-15 05:43:15,153 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-15 05:43:15,153 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-15 05:43:15,153 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-15 05:43:15,154 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-15 05:43:15,154 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-15 05:43:15,154 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-15 05:43:15,154 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-15 05:43:15,155 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-15 05:43:15,155 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-15 05:43:15,155 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-15 05:43:15,155 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-15 05:43:15,156 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-15 05:43:15,156 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-15 05:43:15,156 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-15 05:43:15,156 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-15 05:43:15,157 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-15 05:43:15,157 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-15 05:43:15,157 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-15 05:43:15,157 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-15 05:43:15,158 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-15 05:43:15,158 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-15 05:43:15,158 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-15 05:43:15,158 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-15 05:43:15,159 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-15 05:43:15,159 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-15 05:43:15,159 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-15 05:43:15,159 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-15 05:43:15,160 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-15 05:43:15,160 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-15 05:43:15,160 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-15 05:43:15,160 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-15 05:43:15,161 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-15 05:43:15,161 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-15 05:43:15,161 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-15 05:43:15,161 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-15 05:43:15,161 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-15 05:43:15,162 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-15 05:43:15,162 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-15 05:43:15,162 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-15 05:43:15,162 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-15 05:43:15,163 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-15 05:43:15,163 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-15 05:43:15,163 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-15 05:43:15,163 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-15 05:43:15,164 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-15 05:43:15,164 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-15 05:43:15,165 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-15 05:43:15,165 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-15 05:43:15,165 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-15 05:43:15,166 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-15 05:43:15,166 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-15 05:43:15,166 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-15 05:43:15,166 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-15 05:43:15,167 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-15 05:43:15,167 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-15 05:43:15,167 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-15 05:43:15,167 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-15 05:43:15,168 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-15 05:43:15,168 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-15 05:43:15,168 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-15 05:43:15,168 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-15 05:43:15,169 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-15 05:43:15,169 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-15 05:43:15,169 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-15 05:43:15,169 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-15 05:43:15,170 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-15 05:43:15,170 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-15 05:43:15,170 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-15 05:43:15,170 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-15 05:43:15,170 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-15 05:43:15,171 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-15 05:43:15,171 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-15 05:43:15,171 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-15 05:43:15,171 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-15 05:43:15,172 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-15 05:43:15,172 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-15 05:43:15,172 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-15 05:43:15,172 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-15 05:43:15,173 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-15 05:43:15,173 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-15 05:43:15,173 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-15 05:43:15,173 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-15 05:43:15,174 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-15 05:43:15,174 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-15 05:43:15,174 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-15 05:43:15,174 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-15 05:43:15,175 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-15 05:43:15,175 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-15 05:43:15,175 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-15 05:43:15,175 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-15 05:43:15,176 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-15 05:43:15,176 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-15 05:43:15,176 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-15 05:43:15,176 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-15 05:43:15,177 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-15 05:43:15,177 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-15 05:43:15,177 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-15 05:43:15,177 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-15 05:43:15,178 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-15 05:43:15,178 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-15 05:43:15,178 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-15 05:43:15,178 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-15 05:43:15,178 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-15 05:43:15,179 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-15 05:43:15,179 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-15 05:43:15,179 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-15 05:43:15,179 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-15 05:43:15,180 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-15 05:43:15,180 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-15 05:43:15,180 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-15 05:43:15,180 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-15 05:43:15,181 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-15 05:43:15,181 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-15 05:43:15,181 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-15 05:43:15,181 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-15 05:43:15,182 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-15 05:43:15,182 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-15 05:43:15,182 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-15 05:43:15,182 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-15 05:43:15,183 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-15 05:43:15,183 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-15 05:43:15,183 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-15 05:43:15,183 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-15 05:43:15,184 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-15 05:43:15,184 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-15 05:43:15,184 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-15 05:43:15,184 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-15 05:43:15,184 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-15 05:43:15,185 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-15 05:43:15,185 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-15 05:43:15,185 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-15 05:43:15,185 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-15 05:43:15,186 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-15 05:43:15,186 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-15 05:43:15,186 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-15 05:43:15,186 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-15 05:43:15,187 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-15 05:43:15,187 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-15 05:43:15,187 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-15 05:43:15,187 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-15 05:43:15,188 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-15 05:43:15,188 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-15 05:43:15,188 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-15 05:43:15,188 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-15 05:43:15,189 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-15 05:43:15,189 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-15 05:43:15,189 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-15 05:43:15,189 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-15 05:43:15,190 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-15 05:43:15,190 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-15 05:43:15,190 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-15 05:43:15,190 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-15 05:43:15,191 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-15 05:43:15,191 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-15 05:43:15,191 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-15 05:43:15,191 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-15 05:43:15,191 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-15 05:43:15,192 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-15 05:43:15,192 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-15 05:43:15,192 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-15 05:43:15,192 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-15 05:43:15,193 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-15 05:43:15,193 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-15 05:43:15,193 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-15 05:43:15,193 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-15 05:43:15,194 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-15 05:43:15,194 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-15 05:43:15,194 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-15 05:43:15,194 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-15 05:43:15,195 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-15 05:43:15,195 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-15 05:43:15,195 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-15 05:43:15,195 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-15 05:43:15,196 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-15 05:43:15,196 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-15 05:43:15,196 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-15 05:43:15,196 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-15 05:43:15,197 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-15 05:43:15,197 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-15 05:43:15,197 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-15 05:43:15,197 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-15 05:43:15,198 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-15 05:43:15,198 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-15 05:43:15,198 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-15 05:43:15,198 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-15 05:43:15,199 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-15 05:43:15,199 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-15 05:43:15,199 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-15 05:43:15,199 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-15 05:43:15,199 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-15 05:43:15,200 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-15 05:43:15,200 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-15 05:43:15,200 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-15 05:43:15,200 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-15 05:43:15,201 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-15 05:43:15,201 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-15 05:43:15,201 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-15 05:43:15,201 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-15 05:43:15,202 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-15 05:43:15,202 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-15 05:43:15,202 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-15 05:43:15,202 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-15 05:43:15,203 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-15 05:43:15,203 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-15 05:43:15,203 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-15 05:43:15,203 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-15 05:43:15,204 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-15 05:43:15,204 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-15 05:43:15,204 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-15 05:43:15,204 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-15 05:43:15,205 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-15 05:43:15,205 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-15 05:43:15,205 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-15 05:43:15,205 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-15 05:43:15,206 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-15 05:43:15,206 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-15 05:43:15,206 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-15 05:43:15,206 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-15 05:43:15,207 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-15 05:43:15,207 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-15 05:43:15,207 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-15 05:43:15,207 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-15 05:43:15,208 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-15 05:43:15,208 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-15 05:43:15,208 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-15 05:43:15,208 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-15 05:43:15,208 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-15 05:43:15,209 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-15 05:43:15,209 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-15 05:43:15,209 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-15 05:43:15,209 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-15 05:43:15,210 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-15 05:43:15,210 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-15 05:43:15,210 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-15 05:43:15,210 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-15 05:43:15,211 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-15 05:43:15,211 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-15 05:43:15,211 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-15 05:43:15,211 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-15 05:43:15,212 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-15 05:43:15,212 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-15 05:43:15,212 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-15 05:43:15,212 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-15 05:43:15,213 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-15 05:43:15,213 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-15 05:43:15,213 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-15 05:43:15,213 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-15 05:43:15,214 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-15 05:43:15,214 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-15 05:43:15,214 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-15 05:43:15,214 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-15 05:43:15,215 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-15 05:43:15,215 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-15 05:43:15,215 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-15 05:43:15,215 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-15 05:43:15,216 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-15 05:43:15,216 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-15 05:43:15,216 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-15 05:43:15,216 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-15 05:43:15,216 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-15 05:43:15,217 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-15 05:43:15,217 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-15 05:43:15,217 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-15 05:43:15,217 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-15 05:43:15,218 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-15 05:43:15,218 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-15 05:43:15,218 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-15 05:43:15,218 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-15 05:43:15,219 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-15 05:43:15,219 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-15 05:43:15,219 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-15 05:43:15,219 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-15 05:43:15,220 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-15 05:43:15,220 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-15 05:43:15,220 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-15 05:43:15,220 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-15 05:43:15,221 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-15 05:43:15,221 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-15 05:43:15,221 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-15 05:43:15,221 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-15 05:43:15,222 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-15 05:43:15,222 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-15 05:43:15,222 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-15 05:43:15,222 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-15 05:43:15,223 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-15 05:43:15,223 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-15 05:43:15,223 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-15 05:43:15,223 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-15 05:43:15,223 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-15 05:43:15,224 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-15 05:43:15,224 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-15 05:43:15,224 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-15 05:43:15,224 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-15 05:43:15,225 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-15 05:43:15,225 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-15 05:43:15,225 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-15 05:43:15,225 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-15 05:43:15,226 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-15 05:43:15,226 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-15 05:43:15,226 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-15 05:43:15,226 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-15 05:43:15,227 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-15 05:43:15,227 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-15 05:43:15,227 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-15 05:43:15,227 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-15 05:43:15,228 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-15 05:43:15,228 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-15 05:43:15,228 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-15 05:43:15,228 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-15 05:43:15,229 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-15 05:43:15,229 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-15 05:43:15,229 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-15 05:43:15,229 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-15 05:43:15,230 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-15 05:43:15,230 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-15 05:43:15,230 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-15 05:43:15,231 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-15 05:43:15,231 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-15 05:43:15,231 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-15 05:43:15,232 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-15 05:43:15,232 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-15 05:43:15,232 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-15 05:43:15,233 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-15 05:43:15,233 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-15 05:43:15,234 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-15 05:43:15,234 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-15 05:43:15,234 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-15 05:43:15,234 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-15 05:43:15,234 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-15 05:43:15,234 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-15 05:43:15,234 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-15 05:43:15,234 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-15 05:43:15,235 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-15 05:43:15,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:15,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713065969] [2022-04-15 05:43:15,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713065969] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:15,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819602383] [2022-04-15 05:43:15,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:43:15,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:15,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:15,236 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-15 05:43:15,238 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-15 05:43:15,775 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:43:15,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:43:15,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 05:43:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:15,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:17,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44426#true} is VALID [2022-04-15 05:43:17,279 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-15 05:43:17,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-15 05:43:17,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-15 05:43:17,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-15 05:43:17,279 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-15 05:43:17,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:17,279 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-15 05:43:17,279 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-15 05:43:17,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:17,279 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-15 05:43:17,279 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-15 05:43:17,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:17,280 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-15 05:43:17,280 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-15 05:43:17,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:17,280 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-15 05:43:17,280 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-15 05:43:17,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:17,280 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-15 05:43:17,280 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-15 05:43:17,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {44426#true} assume !(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:17,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {44426#true} ~i~0 := 0; {44426#true} is VALID [2022-04-15 05:43:17,281 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-15 05:43:17,281 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-15 05:43:17,281 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-15 05:43:17,282 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-15 05:43:17,282 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-15 05:43:17,282 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-15 05:43:17,282 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-15 05:43:17,283 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-15 05:43:17,283 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-15 05:43:17,283 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-15 05:43:17,284 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-15 05:43:17,284 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-15 05:43:17,284 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-15 05:43:17,285 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-15 05:43:17,285 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-15 05:43:17,285 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-15 05:43:17,286 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-15 05:43:17,286 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-15 05:43:17,286 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-15 05:43:17,287 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-15 05:43:17,287 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-15 05:43:17,287 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-15 05:43:17,288 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-15 05:43:17,288 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-15 05:43:17,288 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-15 05:43:17,289 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-15 05:43:17,289 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-15 05:43:17,289 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-15 05:43:17,289 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-15 05:43:17,290 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-15 05:43:17,290 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-15 05:43:17,290 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-15 05:43:17,291 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-15 05:43:17,291 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-15 05:43:17,291 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-15 05:43:17,292 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-15 05:43:17,292 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-15 05:43:17,292 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-15 05:43:17,293 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-15 05:43:17,293 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-15 05:43:17,293 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-15 05:43:17,294 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-15 05:43:17,294 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-15 05:43:17,294 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-15 05:43:17,295 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-15 05:43:17,295 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-15 05:43:17,295 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-15 05:43:17,296 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-15 05:43:17,296 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-15 05:43:17,296 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-15 05:43:17,297 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-15 05:43:17,297 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-15 05:43:17,297 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-15 05:43:17,297 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-15 05:43:17,298 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-15 05:43:17,298 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-15 05:43:17,298 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-15 05:43:17,299 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-15 05:43:17,299 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-15 05:43:17,300 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-15 05:43:17,300 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-15 05:43:17,300 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-15 05:43:17,300 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-15 05:43:17,301 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-15 05:43:17,301 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-15 05:43:17,301 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-15 05:43:17,301 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-15 05:43:17,302 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-15 05:43:17,302 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-15 05:43:17,302 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-15 05:43:17,302 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-15 05:43:17,303 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-15 05:43:17,303 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-15 05:43:17,303 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-15 05:43:17,303 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-15 05:43:17,304 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-15 05:43:17,304 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-15 05:43:17,304 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-15 05:43:17,304 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-15 05:43:17,305 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-15 05:43:17,305 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-15 05:43:17,305 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-15 05:43:17,305 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-15 05:43:17,306 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-15 05:43:17,306 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-15 05:43:17,306 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-15 05:43:17,306 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-15 05:43:17,307 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-15 05:43:17,307 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-15 05:43:17,307 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-15 05:43:17,307 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-15 05:43:17,308 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-15 05:43:17,308 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-15 05:43:17,308 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-15 05:43:17,309 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-15 05:43:17,309 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-15 05:43:17,309 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-15 05:43:17,309 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-15 05:43:17,310 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-15 05:43:17,310 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-15 05:43:17,310 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-15 05:43:17,311 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-15 05:43:17,311 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-15 05:43:17,311 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-15 05:43:17,311 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-15 05:43:17,312 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-15 05:43:17,312 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-15 05:43:17,312 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-15 05:43:17,313 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-15 05:43:17,313 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-15 05:43:17,313 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-15 05:43:17,313 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-15 05:43:17,314 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-15 05:43:17,314 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-15 05:43:17,314 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-15 05:43:17,315 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-15 05:43:17,315 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-15 05:43:17,315 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-15 05:43:17,315 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-15 05:43:17,316 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-15 05:43:17,316 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-15 05:43:17,316 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-15 05:43:17,316 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-15 05:43:17,317 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-15 05:43:17,317 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-15 05:43:17,317 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-15 05:43:17,318 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-15 05:43:17,318 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-15 05:43:17,318 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-15 05:43:17,318 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-15 05:43:17,319 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-15 05:43:17,319 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-15 05:43:17,319 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-15 05:43:17,320 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-15 05:43:17,320 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-15 05:43:17,320 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-15 05:43:17,320 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-15 05:43:17,321 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-15 05:43:17,321 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-15 05:43:17,321 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-15 05:43:17,322 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-15 05:43:17,322 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-15 05:43:17,322 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-15 05:43:17,322 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-15 05:43:17,323 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-15 05:43:17,323 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-15 05:43:17,323 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-15 05:43:17,324 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-15 05:43:17,324 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-15 05:43:17,324 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-15 05:43:17,324 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-15 05:43:17,325 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-15 05:43:17,325 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-15 05:43:17,325 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-15 05:43:17,325 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-15 05:43:17,326 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-15 05:43:17,326 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-15 05:43:17,326 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-15 05:43:17,327 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-15 05:43:17,327 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-15 05:43:17,327 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-15 05:43:17,327 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-15 05:43:17,328 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-15 05:43:17,328 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-15 05:43:17,328 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-15 05:43:17,329 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-15 05:43:17,329 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-15 05:43:17,329 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-15 05:43:17,329 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-15 05:43:17,330 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-15 05:43:17,330 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-15 05:43:17,331 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-15 05:43:17,331 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-15 05:43:17,331 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-15 05:43:17,332 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-15 05:43:17,332 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-15 05:43:17,332 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-15 05:43:17,332 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-15 05:43:17,333 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-15 05:43:17,333 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-15 05:43:17,333 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-15 05:43:17,334 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-15 05:43:17,334 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-15 05:43:17,334 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-15 05:43:17,334 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-15 05:43:17,335 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-15 05:43:17,335 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-15 05:43:17,335 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-15 05:43:17,335 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-15 05:43:17,336 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-15 05:43:17,336 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-15 05:43:17,336 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-15 05:43:17,337 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-15 05:43:17,337 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-15 05:43:17,337 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-15 05:43:17,337 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-15 05:43:17,338 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-15 05:43:17,338 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-15 05:43:17,338 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-15 05:43:17,339 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-15 05:43:17,339 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-15 05:43:17,339 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-15 05:43:17,339 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-15 05:43:17,340 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-15 05:43:17,340 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-15 05:43:17,340 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-15 05:43:17,340 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-15 05:43:17,341 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-15 05:43:17,341 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-15 05:43:17,341 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-15 05:43:17,342 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-15 05:43:17,342 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-15 05:43:17,342 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-15 05:43:17,342 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-15 05:43:17,343 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-15 05:43:17,343 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-15 05:43:17,343 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-15 05:43:17,343 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-15 05:43:17,344 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-15 05:43:17,344 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-15 05:43:17,344 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-15 05:43:17,344 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-15 05:43:17,345 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-15 05:43:17,345 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-15 05:43:17,345 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-15 05:43:17,345 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-15 05:43:17,346 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-15 05:43:17,346 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-15 05:43:17,346 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-15 05:43:17,346 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-15 05:43:17,347 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-15 05:43:17,347 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-15 05:43:17,347 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-15 05:43:17,348 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-15 05:43:17,348 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-15 05:43:17,348 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-15 05:43:17,348 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-15 05:43:17,349 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-15 05:43:17,349 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-15 05:43:17,349 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-15 05:43:17,350 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-15 05:43:17,350 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-15 05:43:17,350 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-15 05:43:17,350 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-15 05:43:17,351 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-15 05:43:17,351 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-15 05:43:17,351 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-15 05:43:17,352 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-15 05:43:17,352 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-15 05:43:17,352 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-15 05:43:17,352 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-15 05:43:17,353 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-15 05:43:17,353 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-15 05:43:17,353 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-15 05:43:17,354 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-15 05:43:17,354 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-15 05:43:17,354 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-15 05:43:17,354 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-15 05:43:17,355 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-15 05:43:17,355 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-15 05:43:17,355 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-15 05:43:17,356 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-15 05:43:17,356 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-15 05:43:17,356 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-15 05:43:17,356 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-15 05:43:17,357 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-15 05:43:17,357 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-15 05:43:17,357 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-15 05:43:17,358 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-15 05:43:17,358 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-15 05:43:17,358 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-15 05:43:17,358 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-15 05:43:17,359 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-15 05:43:17,359 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-15 05:43:17,359 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-15 05:43:17,360 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-15 05:43:17,360 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-15 05:43:17,360 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-15 05:43:17,360 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-15 05:43:17,361 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-15 05:43:17,361 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-15 05:43:17,361 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-15 05:43:17,362 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-15 05:43:17,362 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-15 05:43:17,362 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-15 05:43:17,363 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-15 05:43:17,363 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-15 05:43:17,363 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-15 05:43:17,363 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-15 05:43:17,364 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-15 05:43:17,364 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-15 05:43:17,364 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-15 05:43:17,364 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-15 05:43:17,365 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-15 05:43:17,365 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-15 05:43:17,365 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-15 05:43:17,366 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-15 05:43:17,366 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-15 05:43:17,366 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-15 05:43:17,366 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-15 05:43:17,367 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-15 05:43:17,367 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-15 05:43:17,367 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-15 05:43:17,368 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-15 05:43:17,368 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-15 05:43:17,368 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-15 05:43:17,368 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-15 05:43:17,369 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-15 05:43:17,369 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-15 05:43:17,369 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-15 05:43:17,370 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-15 05:43:17,370 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-15 05:43:17,370 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-15 05:43:17,370 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-15 05:43:17,371 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-15 05:43:17,371 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-15 05:43:17,371 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-15 05:43:17,372 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-15 05:43:17,372 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-15 05:43:17,373 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-15 05:43:17,373 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-15 05:43:17,374 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-15 05:43:17,374 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-15 05:43:17,375 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-15 05:43:17,375 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-15 05:43:17,375 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-15 05:43:17,376 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-15 05:43:17,376 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-15 05:43:17,376 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-15 05:43:17,376 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-15 05:43:17,376 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-15 05:43:17,376 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-15 05:43:17,376 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-15 05:43:17,377 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-15 05:43:17,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:18,702 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-15 05:43:18,702 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-15 05:43:18,702 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-15 05:43:18,702 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-15 05:43:18,703 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-15 05:43:18,703 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-15 05:43:18,703 INFO L290 TraceCheckUtils]: 349: Hoare triple {45548#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {44427#false} is VALID [2022-04-15 05:43:18,703 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-15 05:43:18,704 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-15 05:43:18,704 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-15 05:43:18,704 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-15 05:43:18,705 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-15 05:43:18,705 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-15 05:43:18,705 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-15 05:43:18,706 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-15 05:43:18,706 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-15 05:43:18,706 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-15 05:43:18,707 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-15 05:43:18,707 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-15 05:43:18,707 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-15 05:43:18,708 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-15 05:43:18,708 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-15 05:43:18,708 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-15 05:43:18,708 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-15 05:43:18,709 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-15 05:43:18,709 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-15 05:43:18,709 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-15 05:43:18,709 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-15 05:43:18,710 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-15 05:43:18,710 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-15 05:43:18,710 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-15 05:43:18,711 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-15 05:43:18,711 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-15 05:43:18,711 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-15 05:43:18,711 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-15 05:43:18,712 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-15 05:43:18,712 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-15 05:43:18,712 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-15 05:43:18,713 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-15 05:43:18,713 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-15 05:43:18,713 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-15 05:43:18,713 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-15 05:43:18,714 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-15 05:43:18,714 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-15 05:43:18,714 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-15 05:43:18,714 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-15 05:43:18,715 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-15 05:43:18,715 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-15 05:43:18,715 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-15 05:43:18,716 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-15 05:43:18,716 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-15 05:43:18,716 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-15 05:43:18,716 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-15 05:43:18,717 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-15 05:43:18,720 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-15 05:43:18,721 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-15 05:43:18,721 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-15 05:43:18,721 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-15 05:43:18,721 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-15 05:43:18,722 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-15 05:43:18,722 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-15 05:43:18,722 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-15 05:43:18,723 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-15 05:43:18,723 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-15 05:43:18,723 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-15 05:43:18,724 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-15 05:43:18,724 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-15 05:43:18,724 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-15 05:43:18,724 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-15 05:43:18,725 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-15 05:43:18,725 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-15 05:43:18,725 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-15 05:43:18,726 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-15 05:43:18,726 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-15 05:43:18,726 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-15 05:43:18,726 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-15 05:43:18,727 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-15 05:43:18,727 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-15 05:43:18,727 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-15 05:43:18,728 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-15 05:43:18,728 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-15 05:43:18,728 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-15 05:43:18,728 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-15 05:43:18,729 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-15 05:43:18,729 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-15 05:43:18,729 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-15 05:43:18,730 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-15 05:43:18,730 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-15 05:43:18,730 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-15 05:43:18,730 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-15 05:43:18,731 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-15 05:43:18,731 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-15 05:43:18,731 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-15 05:43:18,732 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-15 05:43:18,732 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-15 05:43:18,732 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-15 05:43:18,732 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-15 05:43:18,733 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-15 05:43:18,733 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-15 05:43:18,733 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-15 05:43:18,734 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-15 05:43:18,734 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-15 05:43:18,734 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-15 05:43:18,734 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-15 05:43:18,735 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-15 05:43:18,735 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-15 05:43:18,735 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-15 05:43:18,736 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-15 05:43:18,736 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-15 05:43:18,736 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-15 05:43:18,736 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-15 05:43:18,737 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-15 05:43:18,737 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-15 05:43:18,737 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-15 05:43:18,738 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-15 05:43:18,738 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-15 05:43:18,738 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-15 05:43:18,738 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-15 05:43:18,739 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-15 05:43:18,739 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-15 05:43:18,739 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-15 05:43:18,740 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-15 05:43:18,740 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-15 05:43:18,740 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-15 05:43:18,740 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-15 05:43:18,741 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-15 05:43:18,741 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-15 05:43:18,741 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-15 05:43:18,742 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-15 05:43:18,742 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-15 05:43:18,742 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-15 05:43:18,743 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-15 05:43:18,743 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-15 05:43:18,743 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-15 05:43:18,743 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-15 05:43:18,744 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-15 05:43:18,744 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-15 05:43:18,744 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-15 05:43:18,744 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-15 05:43:18,745 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-15 05:43:18,745 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-15 05:43:18,745 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-15 05:43:18,746 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-15 05:43:18,746 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-15 05:43:18,746 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-15 05:43:18,746 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-15 05:43:18,747 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-15 05:43:18,747 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-15 05:43:18,747 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-15 05:43:18,748 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-15 05:43:18,748 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-15 05:43:18,748 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-15 05:43:18,748 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-15 05:43:18,749 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-15 05:43:18,749 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-15 05:43:18,749 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-15 05:43:18,752 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-15 05:43:18,752 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-15 05:43:18,752 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-15 05:43:18,753 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-15 05:43:18,753 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-15 05:43:18,753 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-15 05:43:18,754 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-15 05:43:18,754 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-15 05:43:18,754 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-15 05:43:18,754 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-15 05:43:18,755 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-15 05:43:18,755 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-15 05:43:18,755 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-15 05:43:18,756 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-15 05:43:18,756 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-15 05:43:18,756 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-15 05:43:18,756 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-15 05:43:18,757 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-15 05:43:18,757 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-15 05:43:18,757 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-15 05:43:18,757 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-15 05:43:18,758 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-15 05:43:18,758 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-15 05:43:18,758 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-15 05:43:18,759 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-15 05:43:18,759 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-15 05:43:18,759 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-15 05:43:18,759 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-15 05:43:18,760 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-15 05:43:18,760 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-15 05:43:18,760 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-15 05:43:18,760 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-15 05:43:18,761 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-15 05:43:18,761 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-15 05:43:18,761 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-15 05:43:18,762 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-15 05:43:18,762 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-15 05:43:18,762 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-15 05:43:18,762 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-15 05:43:18,763 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-15 05:43:18,763 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-15 05:43:18,763 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-15 05:43:18,764 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-15 05:43:18,764 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-15 05:43:18,764 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-15 05:43:18,764 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-15 05:43:18,765 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-15 05:43:18,765 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-15 05:43:18,765 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-15 05:43:18,765 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-15 05:43:18,766 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-15 05:43:18,766 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-15 05:43:18,766 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-15 05:43:18,767 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-15 05:43:18,767 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-15 05:43:18,767 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-15 05:43:18,767 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-15 05:43:18,768 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-15 05:43:18,768 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-15 05:43:18,768 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-15 05:43:18,769 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-15 05:43:18,769 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-15 05:43:18,769 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-15 05:43:18,769 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-15 05:43:18,770 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-15 05:43:18,770 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-15 05:43:18,770 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-15 05:43:18,771 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-15 05:43:18,771 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-15 05:43:18,771 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-15 05:43:18,771 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-15 05:43:18,772 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-15 05:43:18,772 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-15 05:43:18,772 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-15 05:43:18,773 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-15 05:43:18,773 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-15 05:43:18,773 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-15 05:43:18,773 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-15 05:43:18,774 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-15 05:43:18,774 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-15 05:43:18,774 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-15 05:43:18,775 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-15 05:43:18,775 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-15 05:43:18,775 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-15 05:43:18,775 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-15 05:43:18,776 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-15 05:43:18,776 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-15 05:43:18,776 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-15 05:43:18,777 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-15 05:43:18,777 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-15 05:43:18,777 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-15 05:43:18,777 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-15 05:43:18,778 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-15 05:43:18,778 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-15 05:43:18,778 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-15 05:43:18,778 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-15 05:43:18,779 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-15 05:43:18,779 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-15 05:43:18,779 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-15 05:43:18,780 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-15 05:43:18,780 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-15 05:43:18,780 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-15 05:43:18,780 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-15 05:43:18,781 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-15 05:43:18,781 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-15 05:43:18,781 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-15 05:43:18,782 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-15 05:43:18,782 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-15 05:43:18,782 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-15 05:43:18,782 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-15 05:43:18,783 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-15 05:43:18,783 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-15 05:43:18,783 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-15 05:43:18,784 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-15 05:43:18,784 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-15 05:43:18,784 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-15 05:43:18,784 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-15 05:43:18,785 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-15 05:43:18,785 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-15 05:43:18,786 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-15 05:43:18,786 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-15 05:43:18,786 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-15 05:43:18,787 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-15 05:43:18,787 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-15 05:43:18,787 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-15 05:43:18,788 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-15 05:43:18,788 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-15 05:43:18,788 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-15 05:43:18,789 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-15 05:43:18,789 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-15 05:43:18,789 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-15 05:43:18,790 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-15 05:43:18,790 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-15 05:43:18,791 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-15 05:43:18,791 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-15 05:43:18,791 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-15 05:43:18,792 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-15 05:43:18,792 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-15 05:43:18,793 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-15 05:43:18,793 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-15 05:43:18,793 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-15 05:43:18,794 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-15 05:43:18,794 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-15 05:43:18,794 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-15 05:43:18,795 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-15 05:43:18,795 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-15 05:43:18,796 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-15 05:43:18,796 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-15 05:43:18,796 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-15 05:43:18,796 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-15 05:43:18,797 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-15 05:43:18,797 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-15 05:43:18,797 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-15 05:43:18,798 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-15 05:43:18,798 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-15 05:43:18,799 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-15 05:43:18,799 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-15 05:43:18,799 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-15 05:43:18,800 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-15 05:43:18,800 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-15 05:43:18,800 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-15 05:43:18,801 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-15 05:43:18,801 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-15 05:43:18,801 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-15 05:43:18,802 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-15 05:43:18,802 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-15 05:43:18,802 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-15 05:43:18,803 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-15 05:43:18,803 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-15 05:43:18,803 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-15 05:43:18,804 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-15 05:43:18,804 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-15 05:43:18,805 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-15 05:43:18,805 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-15 05:43:18,806 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-15 05:43:18,806 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-15 05:43:18,806 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-15 05:43:18,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {44426#true} ~i~0 := 0; {44426#true} is VALID [2022-04-15 05:43:18,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {44426#true} assume !(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:18,807 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-15 05:43:18,807 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-15 05:43:18,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:18,807 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-15 05:43:18,807 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-15 05:43:18,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:18,807 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-15 05:43:18,807 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-15 05:43:18,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:18,807 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-15 05:43:18,807 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-15 05:43:18,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:18,807 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-15 05:43:18,807 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-15 05:43:18,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-15 05:43:18,808 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-15 05:43:18,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-15 05:43:18,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-15 05:43:18,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-15 05:43:18,808 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-15 05:43:18,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44426#true} is VALID [2022-04-15 05:43:18,809 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-15 05:43:18,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819602383] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:18,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:18,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 27, 27] total 54 [2022-04-15 05:43:18,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:18,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [280995332] [2022-04-15 05:43:18,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [280995332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:18,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:18,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:43:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391339284] [2022-04-15 05:43:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:18,810 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-15 05:43:18,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:18,810 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-15 05:43:18,837 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-15 05:43:18,838 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:43:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:43:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2044, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 05:43:18,839 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-15 05:43:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:20,778 INFO L93 Difference]: Finished difference Result 393 states and 507 transitions. [2022-04-15 05:43:20,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:43:20,778 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-15 05:43:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:20,779 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-15 05:43:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-04-15 05:43:20,780 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-15 05:43:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-04-15 05:43:20,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 120 transitions. [2022-04-15 05:43:20,879 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-15 05:43:20,884 INFO L225 Difference]: With dead ends: 393 [2022-04-15 05:43:20,884 INFO L226 Difference]: Without dead ends: 382 [2022-04-15 05:43:20,885 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=894, Invalid=2528, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 05:43:20,885 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-15 05:43:20,885 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-15 05:43:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-04-15 05:43:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 364. [2022-04-15 05:43:22,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:22,402 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-15 05:43:22,402 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-15 05:43:22,403 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-15 05:43:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:22,408 INFO L93 Difference]: Finished difference Result 382 states and 495 transitions. [2022-04-15 05:43:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 495 transitions. [2022-04-15 05:43:22,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:22,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:22,409 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-15 05:43:22,409 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-15 05:43:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:22,414 INFO L93 Difference]: Finished difference Result 382 states and 495 transitions. [2022-04-15 05:43:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 495 transitions. [2022-04-15 05:43:22,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:22,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:22,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:22,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:22,415 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-15 05:43:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 473 transitions. [2022-04-15 05:43:22,421 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 473 transitions. Word has length 356 [2022-04-15 05:43:22,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:22,421 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 473 transitions. [2022-04-15 05:43:22,421 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-15 05:43:22,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 473 transitions. [2022-04-15 05:43:23,132 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-15 05:43:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 473 transitions. [2022-04-15 05:43:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-04-15 05:43:23,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:23,134 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-15 05:43:23,153 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-15 05:43:23,335 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-15 05:43:23,335 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:23,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1962575558, now seen corresponding path program 59 times [2022-04-15 05:43:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:23,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576996053] [2022-04-15 05:43:23,339 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:23,339 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:23,339 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1962575558, now seen corresponding path program 60 times [2022-04-15 05:43:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:23,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864237616] [2022-04-15 05:43:23,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:23,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:23,664 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-15 05:43:23,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-15 05:43:23,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-15 05:43:23,664 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-15 05:43:23,665 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-15 05:43:23,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-15 05:43:23,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-15 05:43:23,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-15 05:43:23,666 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-15 05:43:23,667 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-15 05:43:23,667 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-15 05:43:23,667 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-15 05:43:23,667 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-15 05:43:23,668 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-15 05:43:23,668 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-15 05:43:23,668 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-15 05:43:23,668 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-15 05:43:23,669 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-15 05:43:23,669 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-15 05:43:23,669 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-15 05:43:23,669 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-15 05:43:23,669 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-15 05:43:23,670 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-15 05:43:23,670 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-15 05:43:23,670 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-15 05:43:23,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:43:23,671 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-15 05:43:23,671 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-15 05:43:23,671 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-15 05:43:23,671 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-15 05:43:23,672 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-15 05:43:23,672 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-15 05:43:23,672 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-15 05:43:23,672 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-15 05:43:23,673 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-15 05:43:23,673 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-15 05:43:23,673 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-15 05:43:23,673 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-15 05:43:23,674 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-15 05:43:23,674 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-15 05:43:23,674 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-15 05:43:23,674 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-15 05:43:23,674 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-15 05:43:23,675 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-15 05:43:23,675 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-15 05:43:23,675 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-15 05:43:23,675 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-15 05:43:23,676 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-15 05:43:23,676 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-15 05:43:23,676 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-15 05:43:23,676 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-15 05:43:23,676 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-15 05:43:23,677 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-15 05:43:23,677 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-15 05:43:23,677 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-15 05:43:23,677 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-15 05:43:23,678 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-15 05:43:23,678 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-15 05:43:23,678 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-15 05:43:23,678 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-15 05:43:23,679 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-15 05:43:23,679 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-15 05:43:23,679 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-15 05:43:23,679 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-15 05:43:23,679 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-15 05:43:23,680 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-15 05:43:23,680 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-15 05:43:23,680 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-15 05:43:23,680 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-15 05:43:23,681 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-15 05:43:23,681 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-15 05:43:23,681 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-15 05:43:23,681 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-15 05:43:23,681 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-15 05:43:23,682 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-15 05:43:23,682 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-15 05:43:23,682 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-15 05:43:23,682 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-15 05:43:23,683 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-15 05:43:23,683 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-15 05:43:23,683 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-15 05:43:23,683 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-15 05:43:23,683 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-15 05:43:23,684 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-15 05:43:23,684 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-15 05:43:23,684 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-15 05:43:23,684 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-15 05:43:23,685 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-15 05:43:23,685 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-15 05:43:23,685 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-15 05:43:23,685 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-15 05:43:23,685 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-15 05:43:23,686 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-15 05:43:23,686 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-15 05:43:23,686 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-15 05:43:23,686 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-15 05:43:23,687 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-15 05:43:23,687 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-15 05:43:23,687 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-15 05:43:23,687 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-15 05:43:23,688 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-15 05:43:23,688 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-15 05:43:23,688 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-15 05:43:23,688 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-15 05:43:23,688 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-15 05:43:23,689 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-15 05:43:23,689 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-15 05:43:23,689 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-15 05:43:23,689 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-15 05:43:23,690 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-15 05:43:23,690 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-15 05:43:23,690 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-15 05:43:23,690 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-15 05:43:23,690 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-15 05:43:23,691 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-15 05:43:23,691 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-15 05:43:23,691 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-15 05:43:23,691 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-15 05:43:23,692 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-15 05:43:23,692 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-15 05:43:23,692 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-15 05:43:23,692 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-15 05:43:23,692 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-15 05:43:23,693 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-15 05:43:23,693 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-15 05:43:23,693 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-15 05:43:23,693 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-15 05:43:23,694 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-15 05:43:23,694 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-15 05:43:23,694 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-15 05:43:23,694 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-15 05:43:23,694 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-15 05:43:23,695 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-15 05:43:23,695 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-15 05:43:23,695 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-15 05:43:23,695 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-15 05:43:23,696 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-15 05:43:23,696 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-15 05:43:23,696 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-15 05:43:23,696 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-15 05:43:23,696 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-15 05:43:23,697 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-15 05:43:23,697 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-15 05:43:23,697 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-15 05:43:23,697 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-15 05:43:23,698 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-15 05:43:23,698 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-15 05:43:23,698 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-15 05:43:23,698 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-15 05:43:23,698 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-15 05:43:23,699 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-15 05:43:23,699 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-15 05:43:23,699 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-15 05:43:23,699 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-15 05:43:23,700 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-15 05:43:23,700 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-15 05:43:23,700 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-15 05:43:23,700 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-15 05:43:23,700 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-15 05:43:23,701 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-15 05:43:23,701 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-15 05:43:23,701 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-15 05:43:23,701 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-15 05:43:23,702 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-15 05:43:23,702 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-15 05:43:23,702 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-15 05:43:23,702 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-15 05:43:23,702 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-15 05:43:23,703 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-15 05:43:23,703 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-15 05:43:23,703 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-15 05:43:23,703 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-15 05:43:23,704 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-15 05:43:23,704 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-15 05:43:23,704 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-15 05:43:23,704 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-15 05:43:23,704 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-15 05:43:23,705 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-15 05:43:23,705 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-15 05:43:23,705 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-15 05:43:23,705 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-15 05:43:23,706 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-15 05:43:23,706 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-15 05:43:23,706 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-15 05:43:23,706 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-15 05:43:23,707 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-15 05:43:23,707 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-15 05:43:23,707 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-15 05:43:23,707 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-15 05:43:23,707 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-15 05:43:23,708 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-15 05:43:23,708 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-15 05:43:23,708 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-15 05:43:23,708 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-15 05:43:23,709 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-15 05:43:23,709 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-15 05:43:23,709 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-15 05:43:23,709 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-15 05:43:23,709 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-15 05:43:23,710 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-15 05:43:23,710 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-15 05:43:23,710 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-15 05:43:23,710 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-15 05:43:23,711 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-15 05:43:23,711 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-15 05:43:23,711 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-15 05:43:23,711 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-15 05:43:23,712 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-15 05:43:23,712 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-15 05:43:23,712 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-15 05:43:23,712 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-15 05:43:23,712 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-15 05:43:23,713 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-15 05:43:23,713 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-15 05:43:23,713 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-15 05:43:23,713 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-15 05:43:23,714 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-15 05:43:23,714 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-15 05:43:23,714 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-15 05:43:23,714 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-15 05:43:23,714 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-15 05:43:23,715 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-15 05:43:23,715 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-15 05:43:23,715 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-15 05:43:23,715 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-15 05:43:23,716 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-15 05:43:23,716 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-15 05:43:23,716 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-15 05:43:23,716 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-15 05:43:23,716 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-15 05:43:23,717 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-15 05:43:23,717 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-15 05:43:23,717 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-15 05:43:23,717 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-15 05:43:23,718 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-15 05:43:23,718 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-15 05:43:23,718 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-15 05:43:23,718 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-15 05:43:23,718 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-15 05:43:23,719 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-15 05:43:23,719 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-15 05:43:23,719 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-15 05:43:23,719 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-15 05:43:23,720 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-15 05:43:23,720 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-15 05:43:23,720 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-15 05:43:23,720 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-15 05:43:23,720 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-15 05:43:23,721 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-15 05:43:23,721 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-15 05:43:23,721 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-15 05:43:23,721 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-15 05:43:23,722 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-15 05:43:23,722 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-15 05:43:23,722 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-15 05:43:23,722 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-15 05:43:23,722 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-15 05:43:23,723 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-15 05:43:23,723 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-15 05:43:23,723 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-15 05:43:23,723 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-15 05:43:23,724 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-15 05:43:23,724 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-15 05:43:23,724 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-15 05:43:23,724 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-15 05:43:23,724 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-15 05:43:23,725 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-15 05:43:23,725 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-15 05:43:23,725 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-15 05:43:23,725 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-15 05:43:23,726 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-15 05:43:23,726 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-15 05:43:23,726 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-15 05:43:23,726 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-15 05:43:23,726 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-15 05:43:23,727 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-15 05:43:23,727 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-15 05:43:23,727 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-15 05:43:23,727 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-15 05:43:23,728 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-15 05:43:23,728 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-15 05:43:23,728 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-15 05:43:23,728 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-15 05:43:23,729 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-15 05:43:23,729 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-15 05:43:23,729 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-15 05:43:23,729 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-15 05:43:23,729 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-15 05:43:23,730 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-15 05:43:23,730 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-15 05:43:23,730 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-15 05:43:23,730 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-15 05:43:23,731 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-15 05:43:23,731 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-15 05:43:23,731 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-15 05:43:23,731 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-15 05:43:23,731 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-15 05:43:23,732 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-15 05:43:23,732 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-15 05:43:23,732 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-15 05:43:23,732 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-15 05:43:23,733 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-15 05:43:23,733 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-15 05:43:23,733 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-15 05:43:23,733 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-15 05:43:23,733 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-15 05:43:23,734 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-15 05:43:23,734 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-15 05:43:23,734 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-15 05:43:23,734 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-15 05:43:23,735 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-15 05:43:23,735 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-15 05:43:23,735 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-15 05:43:23,735 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-15 05:43:23,735 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-15 05:43:23,736 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-15 05:43:23,736 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-15 05:43:23,736 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-15 05:43:23,736 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-15 05:43:23,737 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-15 05:43:23,737 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-15 05:43:23,737 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-15 05:43:23,737 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-15 05:43:23,737 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-15 05:43:23,738 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-15 05:43:23,738 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-15 05:43:23,738 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-15 05:43:23,738 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-15 05:43:23,739 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-15 05:43:23,739 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-15 05:43:23,739 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-15 05:43:23,739 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-15 05:43:23,740 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-15 05:43:23,740 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-15 05:43:23,740 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-15 05:43:23,740 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-15 05:43:23,740 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-15 05:43:23,741 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-15 05:43:23,741 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-15 05:43:23,741 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-15 05:43:23,741 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-15 05:43:23,741 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-15 05:43:23,742 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-15 05:43:23,742 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-15 05:43:23,743 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-15 05:43:23,743 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-15 05:43:23,743 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-15 05:43:23,744 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-15 05:43:23,744 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-15 05:43:23,744 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-15 05:43:23,744 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-15 05:43:23,745 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-15 05:43:23,745 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-15 05:43:23,745 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-15 05:43:23,746 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-15 05:43:23,746 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-15 05:43:23,746 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-15 05:43:23,746 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-15 05:43:23,746 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-15 05:43:23,746 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-15 05:43:23,746 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-15 05:43:23,746 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-15 05:43:23,747 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-15 05:43:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:23,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864237616] [2022-04-15 05:43:23,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864237616] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:23,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396017711] [2022-04-15 05:43:23,747 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:43:23,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:23,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:23,748 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-15 05:43:23,749 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-15 05:43:25,374 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 05:43:25,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:43:25,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:43:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:25,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:26,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48906#true} is VALID [2022-04-15 05:43:26,693 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-15 05:43:26,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-15 05:43:26,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-15 05:43:26,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-15 05:43:26,696 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-15 05:43:26,696 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-15 05:43:26,696 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-15 05:43:26,697 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-15 05:43:26,697 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-15 05:43:26,697 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-15 05:43:26,697 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-15 05:43:26,698 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-15 05:43:26,698 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-15 05:43:26,698 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-15 05:43:26,698 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-15 05:43:26,699 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-15 05:43:26,699 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-15 05:43:26,699 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-15 05:43:26,700 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-15 05:43:26,700 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-15 05:43:26,700 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-15 05:43:26,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:43:26,701 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-15 05:43:26,701 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-15 05:43:26,701 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-15 05:43:26,701 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-15 05:43:26,702 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-15 05:43:26,702 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-15 05:43:26,702 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-15 05:43:26,703 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-15 05:43:26,703 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-15 05:43:26,703 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-15 05:43:26,703 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-15 05:43:26,704 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-15 05:43:26,704 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-15 05:43:26,704 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-15 05:43:26,704 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-15 05:43:26,705 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-15 05:43:26,705 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-15 05:43:26,705 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-15 05:43:26,706 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-15 05:43:26,706 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-15 05:43:26,706 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-15 05:43:26,706 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-15 05:43:26,707 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-15 05:43:26,707 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-15 05:43:26,707 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-15 05:43:26,707 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-15 05:43:26,708 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-15 05:43:26,708 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-15 05:43:26,708 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-15 05:43:26,708 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-15 05:43:26,709 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-15 05:43:26,709 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-15 05:43:26,709 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-15 05:43:26,710 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-15 05:43:26,710 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-15 05:43:26,710 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-15 05:43:26,710 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-15 05:43:26,711 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-15 05:43:26,711 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-15 05:43:26,711 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-15 05:43:26,712 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-15 05:43:26,712 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-15 05:43:26,712 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-15 05:43:26,712 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-15 05:43:26,713 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-15 05:43:26,713 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-15 05:43:26,713 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-15 05:43:26,713 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-15 05:43:26,714 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-15 05:43:26,714 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-15 05:43:26,714 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-15 05:43:26,714 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-15 05:43:26,715 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-15 05:43:26,715 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-15 05:43:26,715 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-15 05:43:26,716 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-15 05:43:26,716 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-15 05:43:26,716 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-15 05:43:26,716 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-15 05:43:26,717 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-15 05:43:26,717 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-15 05:43:26,717 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-15 05:43:26,717 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-15 05:43:26,718 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-15 05:43:26,718 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-15 05:43:26,718 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-15 05:43:26,719 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-15 05:43:26,719 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-15 05:43:26,719 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-15 05:43:26,719 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-15 05:43:26,720 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-15 05:43:26,720 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-15 05:43:26,720 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-15 05:43:26,720 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-15 05:43:26,721 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-15 05:43:26,721 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-15 05:43:26,721 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-15 05:43:26,722 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-15 05:43:26,722 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-15 05:43:26,722 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-15 05:43:26,722 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-15 05:43:26,723 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-15 05:43:26,723 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-15 05:43:26,723 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-15 05:43:26,723 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-15 05:43:26,724 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-15 05:43:26,724 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-15 05:43:26,724 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-15 05:43:26,724 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-15 05:43:26,725 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-15 05:43:26,725 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-15 05:43:26,725 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-15 05:43:26,726 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-15 05:43:26,726 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-15 05:43:26,726 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-15 05:43:26,726 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-15 05:43:26,727 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-15 05:43:26,727 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-15 05:43:26,727 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-15 05:43:26,727 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-15 05:43:26,728 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-15 05:43:26,728 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-15 05:43:26,728 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-15 05:43:26,729 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-15 05:43:26,729 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-15 05:43:26,729 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-15 05:43:26,729 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-15 05:43:26,730 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-15 05:43:26,730 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-15 05:43:26,730 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-15 05:43:26,730 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-15 05:43:26,731 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-15 05:43:26,731 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-15 05:43:26,731 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-15 05:43:26,732 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-15 05:43:26,732 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-15 05:43:26,732 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-15 05:43:26,732 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-15 05:43:26,733 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-15 05:43:26,733 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-15 05:43:26,733 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-15 05:43:26,733 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-15 05:43:26,734 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-15 05:43:26,734 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-15 05:43:26,734 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-15 05:43:26,735 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-15 05:43:26,735 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-15 05:43:26,735 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-15 05:43:26,735 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-15 05:43:26,736 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-15 05:43:26,736 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-15 05:43:26,736 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-15 05:43:26,737 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-15 05:43:26,737 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-15 05:43:26,737 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-15 05:43:26,737 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-15 05:43:26,738 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-15 05:43:26,738 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-15 05:43:26,738 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-15 05:43:26,738 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-15 05:43:26,739 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-15 05:43:26,739 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-15 05:43:26,739 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-15 05:43:26,739 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-15 05:43:26,740 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-15 05:43:26,740 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-15 05:43:26,740 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-15 05:43:26,741 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-15 05:43:26,741 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-15 05:43:26,741 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-15 05:43:26,741 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-15 05:43:26,742 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-15 05:43:26,742 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-15 05:43:26,742 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-15 05:43:26,743 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-15 05:43:26,743 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-15 05:43:26,743 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-15 05:43:26,743 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-15 05:43:26,744 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-15 05:43:26,744 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-15 05:43:26,744 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-15 05:43:26,744 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-15 05:43:26,745 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-15 05:43:26,745 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-15 05:43:26,745 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-15 05:43:26,745 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-15 05:43:26,746 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-15 05:43:26,746 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-15 05:43:26,746 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-15 05:43:26,747 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-15 05:43:26,747 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-15 05:43:26,747 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-15 05:43:26,747 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-15 05:43:26,748 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-15 05:43:26,748 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-15 05:43:26,748 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-15 05:43:26,748 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-15 05:43:26,749 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-15 05:43:26,749 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-15 05:43:26,749 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-15 05:43:26,750 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-15 05:43:26,750 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-15 05:43:26,750 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-15 05:43:26,750 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-15 05:43:26,751 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-15 05:43:26,751 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-15 05:43:26,751 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-15 05:43:26,751 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-15 05:43:26,752 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-15 05:43:26,752 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-15 05:43:26,752 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-15 05:43:26,753 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-15 05:43:26,753 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-15 05:43:26,753 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-15 05:43:26,753 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-15 05:43:26,754 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-15 05:43:26,754 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-15 05:43:26,754 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-15 05:43:26,754 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-15 05:43:26,755 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-15 05:43:26,755 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-15 05:43:26,755 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-15 05:43:26,756 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-15 05:43:26,756 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-15 05:43:26,756 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-15 05:43:26,756 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-15 05:43:26,757 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-15 05:43:26,757 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-15 05:43:26,757 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-15 05:43:26,757 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-15 05:43:26,758 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-15 05:43:26,758 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-15 05:43:26,758 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-15 05:43:26,759 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-15 05:43:26,759 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-15 05:43:26,759 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-15 05:43:26,759 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-15 05:43:26,760 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-15 05:43:26,760 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-15 05:43:26,760 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-15 05:43:26,760 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-15 05:43:26,761 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-15 05:43:26,761 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-15 05:43:26,761 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-15 05:43:26,762 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-15 05:43:26,762 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-15 05:43:26,762 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-15 05:43:26,762 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-15 05:43:26,763 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-15 05:43:26,763 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-15 05:43:26,763 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-15 05:43:26,763 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-15 05:43:26,764 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-15 05:43:26,764 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-15 05:43:26,764 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-15 05:43:26,765 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-15 05:43:26,765 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-15 05:43:26,765 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-15 05:43:26,765 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-15 05:43:26,766 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-15 05:43:26,766 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-15 05:43:26,766 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-15 05:43:26,767 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-15 05:43:26,767 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-15 05:43:26,767 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-15 05:43:26,767 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-15 05:43:26,768 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-15 05:43:26,768 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-15 05:43:26,768 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-15 05:43:26,768 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-15 05:43:26,769 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-15 05:43:26,769 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-15 05:43:26,769 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-15 05:43:26,770 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-15 05:43:26,770 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-15 05:43:26,770 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-15 05:43:26,770 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-15 05:43:26,771 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-15 05:43:26,771 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-15 05:43:26,771 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-15 05:43:26,771 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-15 05:43:26,772 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-15 05:43:26,772 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-15 05:43:26,772 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-15 05:43:26,773 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-15 05:43:26,773 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-15 05:43:26,773 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-15 05:43:26,773 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-15 05:43:26,774 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-15 05:43:26,774 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-15 05:43:26,774 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-15 05:43:26,774 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-15 05:43:26,775 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-15 05:43:26,775 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-15 05:43:26,775 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-15 05:43:26,776 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-15 05:43:26,776 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-15 05:43:26,776 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-15 05:43:26,776 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-15 05:43:26,777 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-15 05:43:26,777 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-15 05:43:26,777 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-15 05:43:26,777 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-15 05:43:26,778 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-15 05:43:26,778 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-15 05:43:26,778 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-15 05:43:26,779 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-15 05:43:26,779 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-15 05:43:26,779 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-15 05:43:26,779 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-15 05:43:26,780 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-15 05:43:26,780 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-15 05:43:26,780 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-15 05:43:26,780 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-15 05:43:26,781 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-15 05:43:26,781 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-15 05:43:26,781 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-15 05:43:26,782 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-15 05:43:26,782 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-15 05:43:26,782 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-15 05:43:26,782 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-15 05:43:26,783 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-15 05:43:26,783 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-15 05:43:26,783 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-15 05:43:26,783 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-15 05:43:26,784 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-15 05:43:26,784 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-15 05:43:26,784 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-15 05:43:26,785 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-15 05:43:26,785 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-15 05:43:26,785 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-15 05:43:26,785 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-15 05:43:26,786 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-15 05:43:26,786 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-15 05:43:26,786 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-15 05:43:26,787 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-15 05:43:26,787 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-15 05:43:26,788 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-15 05:43:26,788 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-15 05:43:26,788 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-15 05:43:26,789 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-15 05:43:26,789 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-15 05:43:26,790 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-15 05:43:26,790 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-15 05:43:26,791 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-15 05:43:26,791 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-15 05:43:26,791 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-15 05:43:26,792 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-15 05:43:26,792 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-15 05:43:26,793 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-15 05:43:26,793 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-15 05:43:26,793 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-15 05:43:26,793 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-15 05:43:26,793 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-15 05:43:26,793 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-15 05:43:26,793 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-15 05:43:26,794 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-15 05:43:26,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:27,913 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-15 05:43:27,913 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-15 05:43:27,914 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-15 05:43:27,914 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-15 05:43:27,914 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-15 05:43:27,914 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-15 05:43:27,914 INFO L290 TraceCheckUtils]: 352: Hoare triple {50018#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {48907#false} is VALID [2022-04-15 05:43:27,915 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-15 05:43:27,915 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-15 05:43:27,915 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-15 05:43:27,916 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-15 05:43:27,916 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-15 05:43:27,916 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-15 05:43:27,917 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-15 05:43:27,917 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-15 05:43:27,917 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-15 05:43:27,918 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-15 05:43:27,918 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-15 05:43:27,918 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-15 05:43:27,918 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-15 05:43:27,919 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-15 05:43:27,919 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-15 05:43:27,919 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-15 05:43:27,920 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-15 05:43:27,920 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-15 05:43:27,920 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-15 05:43:27,920 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-15 05:43:27,921 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-15 05:43:27,921 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-15 05:43:27,921 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-15 05:43:27,921 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-15 05:43:27,922 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-15 05:43:27,922 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-15 05:43:27,922 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-15 05:43:27,923 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-15 05:43:27,923 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-15 05:43:27,923 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-15 05:43:27,924 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-15 05:43:27,924 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-15 05:43:27,924 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-15 05:43:27,924 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-15 05:43:27,925 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-15 05:43:27,925 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-15 05:43:27,925 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-15 05:43:27,925 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-15 05:43:27,927 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-15 05:43:27,927 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-15 05:43:27,927 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-15 05:43:27,930 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-15 05:43:27,930 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-15 05:43:27,931 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-15 05:43:27,931 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-15 05:43:27,931 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-15 05:43:27,932 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-15 05:43:27,932 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-15 05:43:27,932 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-15 05:43:27,932 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-15 05:43:27,933 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-15 05:43:27,933 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-15 05:43:27,933 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-15 05:43:27,933 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-15 05:43:27,934 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-15 05:43:27,934 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-15 05:43:27,934 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-15 05:43:27,935 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-15 05:43:27,935 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-15 05:43:27,935 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-15 05:43:27,935 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-15 05:43:27,936 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-15 05:43:27,936 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-15 05:43:27,936 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-15 05:43:27,936 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-15 05:43:27,937 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-15 05:43:27,937 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-15 05:43:27,937 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-15 05:43:27,938 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-15 05:43:27,938 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-15 05:43:27,938 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-15 05:43:27,938 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-15 05:43:27,939 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-15 05:43:27,939 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-15 05:43:27,939 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-15 05:43:27,939 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-15 05:43:27,940 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-15 05:43:27,940 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-15 05:43:27,940 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-15 05:43:27,940 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-15 05:43:27,941 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-15 05:43:27,941 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-15 05:43:27,941 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-15 05:43:27,942 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-15 05:43:27,942 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-15 05:43:27,942 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-15 05:43:27,942 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-15 05:43:27,943 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-15 05:43:27,943 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-15 05:43:27,943 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-15 05:43:27,943 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-15 05:43:27,944 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-15 05:43:27,944 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-15 05:43:27,944 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-15 05:43:27,945 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-15 05:43:27,945 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-15 05:43:27,945 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-15 05:43:27,945 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-15 05:43:27,946 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-15 05:43:27,946 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-15 05:43:27,946 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-15 05:43:27,946 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-15 05:43:27,947 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-15 05:43:27,947 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-15 05:43:27,947 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-15 05:43:27,947 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-15 05:43:27,948 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-15 05:43:27,948 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-15 05:43:27,948 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-15 05:43:27,949 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-15 05:43:27,949 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-15 05:43:27,949 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-15 05:43:27,949 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-15 05:43:27,950 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-15 05:43:27,950 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-15 05:43:27,950 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-15 05:43:27,950 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-15 05:43:27,951 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-15 05:43:27,951 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-15 05:43:27,951 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-15 05:43:27,952 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-15 05:43:27,952 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-15 05:43:27,952 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-15 05:43:27,952 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-15 05:43:27,953 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-15 05:43:27,953 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-15 05:43:27,953 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-15 05:43:27,954 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-15 05:43:27,954 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-15 05:43:27,954 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-15 05:43:27,954 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-15 05:43:27,955 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-15 05:43:27,955 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-15 05:43:27,955 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-15 05:43:27,956 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-15 05:43:27,957 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-15 05:43:27,957 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-15 05:43:27,957 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-15 05:43:27,958 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-15 05:43:27,958 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-15 05:43:27,958 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-15 05:43:27,958 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-15 05:43:27,959 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-15 05:43:27,959 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-15 05:43:27,959 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-15 05:43:27,960 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-15 05:43:27,960 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-15 05:43:27,960 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-15 05:43:27,960 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-15 05:43:27,961 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-15 05:43:27,961 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-15 05:43:27,961 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-15 05:43:27,961 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-15 05:43:27,962 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-15 05:43:27,962 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-15 05:43:27,962 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-15 05:43:27,963 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-15 05:43:27,963 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-15 05:43:27,963 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-15 05:43:27,963 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-15 05:43:27,964 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-15 05:43:27,964 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-15 05:43:27,964 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-15 05:43:27,964 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-15 05:43:27,965 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-15 05:43:27,965 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-15 05:43:27,965 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-15 05:43:27,966 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-15 05:43:27,966 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-15 05:43:27,966 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-15 05:43:27,966 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-15 05:43:27,967 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-15 05:43:27,967 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-15 05:43:27,967 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-15 05:43:27,967 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-15 05:43:27,968 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-15 05:43:27,968 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-15 05:43:27,968 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-15 05:43:27,969 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-15 05:43:27,969 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-15 05:43:27,969 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-15 05:43:27,969 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-15 05:43:27,970 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-15 05:43:27,970 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-15 05:43:27,970 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-15 05:43:27,970 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-15 05:43:27,971 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-15 05:43:27,971 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-15 05:43:27,971 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-15 05:43:27,971 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-15 05:43:27,972 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-15 05:43:27,972 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-15 05:43:27,972 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-15 05:43:27,973 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-15 05:43:27,973 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-15 05:43:27,973 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-15 05:43:27,973 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-15 05:43:27,974 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-15 05:43:27,974 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-15 05:43:27,974 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-15 05:43:27,974 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-15 05:43:27,975 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-15 05:43:27,975 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-15 05:43:27,975 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-15 05:43:27,975 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-15 05:43:27,976 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-15 05:43:27,976 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-15 05:43:27,976 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-15 05:43:27,977 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-15 05:43:27,977 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-15 05:43:27,977 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-15 05:43:27,977 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-15 05:43:27,978 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-15 05:43:27,978 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-15 05:43:27,978 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-15 05:43:27,978 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-15 05:43:27,979 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-15 05:43:27,979 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-15 05:43:27,979 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-15 05:43:27,980 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-15 05:43:27,980 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-15 05:43:27,980 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-15 05:43:27,980 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-15 05:43:27,981 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-15 05:43:27,981 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-15 05:43:27,981 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-15 05:43:27,982 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-15 05:43:27,982 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-15 05:43:27,982 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-15 05:43:27,982 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-15 05:43:27,983 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-15 05:43:27,983 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-15 05:43:27,983 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-15 05:43:27,983 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-15 05:43:27,984 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-15 05:43:27,984 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-15 05:43:27,984 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-15 05:43:27,984 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-15 05:43:27,985 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-15 05:43:27,985 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-15 05:43:27,985 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-15 05:43:27,986 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-15 05:43:27,986 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-15 05:43:27,986 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-15 05:43:27,986 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-15 05:43:27,987 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-15 05:43:27,987 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-15 05:43:27,987 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-15 05:43:27,988 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-15 05:43:27,988 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-15 05:43:27,988 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-15 05:43:27,988 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-15 05:43:27,989 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-15 05:43:27,989 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-15 05:43:27,989 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-15 05:43:27,990 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-15 05:43:27,990 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-15 05:43:27,990 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-15 05:43:27,990 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-15 05:43:27,991 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-15 05:43:27,991 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-15 05:43:27,991 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-15 05:43:27,991 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-15 05:43:27,992 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-15 05:43:27,992 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-15 05:43:27,992 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-15 05:43:27,992 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-15 05:43:27,993 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-15 05:43:27,993 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-15 05:43:27,993 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-15 05:43:27,994 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-15 05:43:27,994 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-15 05:43:27,994 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-15 05:43:27,994 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-15 05:43:27,995 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-15 05:43:27,995 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-15 05:43:27,995 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-15 05:43:27,996 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-15 05:43:27,996 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-15 05:43:27,996 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-15 05:43:27,996 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-15 05:43:27,997 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-15 05:43:27,997 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-15 05:43:27,997 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-15 05:43:27,998 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-15 05:43:27,998 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-15 05:43:27,998 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-15 05:43:27,998 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-15 05:43:27,999 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-15 05:43:27,999 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-15 05:43:27,999 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-15 05:43:27,999 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-15 05:43:28,000 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-15 05:43:28,000 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-15 05:43:28,000 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-15 05:43:28,001 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-15 05:43:28,001 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-15 05:43:28,001 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-15 05:43:28,001 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-15 05:43:28,002 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-15 05:43:28,002 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-15 05:43:28,002 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-15 05:43:28,002 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-15 05:43:28,003 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-15 05:43:28,003 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-15 05:43:28,003 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-15 05:43:28,004 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-15 05:43:28,004 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-15 05:43:28,004 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-15 05:43:28,004 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-15 05:43:28,005 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-15 05:43:28,005 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-15 05:43:28,005 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-15 05:43:28,006 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-15 05:43:28,006 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-15 05:43:28,006 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-15 05:43:28,006 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-15 05:43:28,007 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-15 05:43:28,007 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-15 05:43:28,007 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-15 05:43:28,007 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-15 05:43:28,008 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-15 05:43:28,008 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-15 05:43:28,008 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-15 05:43:28,009 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-15 05:43:28,009 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-15 05:43:28,009 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-15 05:43:28,009 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-15 05:43:28,010 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-15 05:43:28,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {50062#(< 4 main_~edgecount~0)} ~i~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-15 05:43:28,010 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-15 05:43:28,010 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-15 05:43:28,011 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-15 05:43:28,011 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-15 05:43:28,011 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-15 05:43:28,011 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-15 05:43:28,012 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-15 05:43:28,012 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-15 05:43:28,012 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-15 05:43:28,013 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-15 05:43:28,013 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-15 05:43:28,013 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-15 05:43:28,013 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-15 05:43:28,014 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-15 05:43:28,014 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-15 05:43:28,014 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-15 05:43:28,016 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-15 05:43:28,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-15 05:43:28,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-15 05:43:28,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-15 05:43:28,017 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-15 05:43:28,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48906#true} is VALID [2022-04-15 05:43:28,017 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-15 05:43:28,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396017711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:28,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:28,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-04-15 05:43:28,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:28,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576996053] [2022-04-15 05:43:28,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576996053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:28,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:28,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:43:28,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248701499] [2022-04-15 05:43:28,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:28,019 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-15 05:43:28,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:28,019 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-15 05:43:28,051 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-15 05:43:28,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:43:28,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:28,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:43:28,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:43:28,052 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-15 05:43:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:30,379 INFO L93 Difference]: Finished difference Result 464 states and 600 transitions. [2022-04-15 05:43:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:43:30,379 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-15 05:43:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:30,379 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-15 05:43:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-04-15 05:43:30,380 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-15 05:43:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-04-15 05:43:30,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 138 transitions. [2022-04-15 05:43:30,492 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-15 05:43:30,501 INFO L225 Difference]: With dead ends: 464 [2022-04-15 05:43:30,501 INFO L226 Difference]: Without dead ends: 453 [2022-04-15 05:43:30,501 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:43:30,501 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-15 05:43:30,501 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-15 05:43:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-15 05:43:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 367. [2022-04-15 05:43:32,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:32,054 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-15 05:43:32,055 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-15 05:43:32,055 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-15 05:43:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:32,063 INFO L93 Difference]: Finished difference Result 453 states and 588 transitions. [2022-04-15 05:43:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 588 transitions. [2022-04-15 05:43:32,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:32,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:32,064 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-15 05:43:32,064 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-15 05:43:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:32,072 INFO L93 Difference]: Finished difference Result 453 states and 588 transitions. [2022-04-15 05:43:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 588 transitions. [2022-04-15 05:43:32,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:32,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:32,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:32,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:32,073 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-15 05:43:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 476 transitions. [2022-04-15 05:43:32,079 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 476 transitions. Word has length 359 [2022-04-15 05:43:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:32,079 INFO L478 AbstractCegarLoop]: Abstraction has 367 states and 476 transitions. [2022-04-15 05:43:32,079 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-15 05:43:32,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 367 states and 476 transitions. [2022-04-15 05:43:32,919 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-15 05:43:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 476 transitions. [2022-04-15 05:43:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-04-15 05:43:32,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:32,922 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-15 05:43:32,941 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-15 05:43:33,122 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-15 05:43:33,122 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash -121056614, now seen corresponding path program 61 times [2022-04-15 05:43:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:33,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286205401] [2022-04-15 05:43:33,126 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:33,126 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:33,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -121056614, now seen corresponding path program 62 times [2022-04-15 05:43:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:33,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002523746] [2022-04-15 05:43:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:33,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:33,434 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-15 05:43:33,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-15 05:43:33,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-15 05:43:33,435 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-15 05:43:33,435 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-15 05:43:33,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-15 05:43:33,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-15 05:43:33,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-15 05:43:33,437 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-15 05:43:33,437 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-15 05:43:33,437 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-15 05:43:33,438 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-15 05:43:33,438 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-15 05:43:33,438 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-15 05:43:33,438 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-15 05:43:33,439 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-15 05:43:33,439 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-15 05:43:33,439 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-15 05:43:33,439 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-15 05:43:33,439 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-15 05:43:33,440 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-15 05:43:33,440 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-15 05:43:33,440 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-15 05:43:33,440 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-15 05:43:33,441 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-15 05:43:33,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:43:33,441 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-15 05:43:33,441 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-15 05:43:33,442 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-15 05:43:33,442 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-15 05:43:33,442 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-15 05:43:33,442 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-15 05:43:33,443 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-15 05:43:33,443 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-15 05:43:33,443 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-15 05:43:33,443 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-15 05:43:33,444 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-15 05:43:33,444 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-15 05:43:33,444 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-15 05:43:33,444 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-15 05:43:33,445 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-15 05:43:33,445 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-15 05:43:33,445 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-15 05:43:33,446 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-15 05:43:33,446 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-15 05:43:33,446 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-15 05:43:33,446 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-15 05:43:33,447 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-15 05:43:33,447 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-15 05:43:33,447 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-15 05:43:33,447 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-15 05:43:33,448 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-15 05:43:33,448 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-15 05:43:33,448 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-15 05:43:33,449 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-15 05:43:33,449 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-15 05:43:33,449 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-15 05:43:33,449 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-15 05:43:33,450 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-15 05:43:33,450 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-15 05:43:33,450 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-15 05:43:33,450 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-15 05:43:33,451 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-15 05:43:33,451 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-15 05:43:33,451 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-15 05:43:33,452 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-15 05:43:33,452 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-15 05:43:33,452 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-15 05:43:33,452 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-15 05:43:33,453 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-15 05:43:33,453 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-15 05:43:33,453 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-15 05:43:33,453 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-15 05:43:33,454 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-15 05:43:33,454 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-15 05:43:33,454 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-15 05:43:33,455 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-15 05:43:33,455 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-15 05:43:33,455 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-15 05:43:33,455 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-15 05:43:33,456 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-15 05:43:33,456 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-15 05:43:33,456 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-15 05:43:33,456 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-15 05:43:33,457 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-15 05:43:33,457 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-15 05:43:33,457 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-15 05:43:33,458 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-15 05:43:33,458 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-15 05:43:33,458 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-15 05:43:33,458 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-15 05:43:33,459 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-15 05:43:33,459 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-15 05:43:33,459 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-15 05:43:33,459 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-15 05:43:33,460 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-15 05:43:33,460 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-15 05:43:33,460 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-15 05:43:33,460 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-15 05:43:33,461 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-15 05:43:33,461 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-15 05:43:33,461 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-15 05:43:33,462 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-15 05:43:33,462 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-15 05:43:33,462 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-15 05:43:33,462 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-15 05:43:33,463 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-15 05:43:33,463 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-15 05:43:33,463 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-15 05:43:33,464 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-15 05:43:33,464 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-15 05:43:33,464 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-15 05:43:33,464 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-15 05:43:33,465 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-15 05:43:33,465 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-15 05:43:33,465 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-15 05:43:33,465 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-15 05:43:33,466 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-15 05:43:33,466 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-15 05:43:33,466 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-15 05:43:33,466 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-15 05:43:33,467 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-15 05:43:33,467 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-15 05:43:33,467 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-15 05:43:33,468 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-15 05:43:33,468 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-15 05:43:33,468 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-15 05:43:33,468 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-15 05:43:33,469 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-15 05:43:33,469 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-15 05:43:33,469 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-15 05:43:33,470 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-15 05:43:33,470 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-15 05:43:33,470 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-15 05:43:33,470 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-15 05:43:33,471 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-15 05:43:33,471 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-15 05:43:33,471 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-15 05:43:33,471 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-15 05:43:33,472 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-15 05:43:33,472 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-15 05:43:33,472 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-15 05:43:33,473 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-15 05:43:33,475 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-15 05:43:33,475 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-15 05:43:33,476 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-15 05:43:33,476 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-15 05:43:33,476 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-15 05:43:33,477 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-15 05:43:33,477 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-15 05:43:33,477 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-15 05:43:33,478 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-15 05:43:33,478 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-15 05:43:33,478 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-15 05:43:33,479 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-15 05:43:33,479 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-15 05:43:33,479 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-15 05:43:33,479 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-15 05:43:33,480 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-15 05:43:33,480 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-15 05:43:33,480 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-15 05:43:33,481 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-15 05:43:33,481 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-15 05:43:33,481 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-15 05:43:33,482 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-15 05:43:33,482 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-15 05:43:33,482 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-15 05:43:33,483 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-15 05:43:33,483 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-15 05:43:33,483 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-15 05:43:33,484 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-15 05:43:33,484 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-15 05:43:33,484 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-15 05:43:33,484 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-15 05:43:33,485 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-15 05:43:33,485 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-15 05:43:33,485 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-15 05:43:33,486 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-15 05:43:33,486 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-15 05:43:33,486 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-15 05:43:33,487 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-15 05:43:33,487 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-15 05:43:33,487 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-15 05:43:33,488 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-15 05:43:33,488 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-15 05:43:33,488 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-15 05:43:33,488 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-15 05:43:33,489 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-15 05:43:33,489 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-15 05:43:33,489 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-15 05:43:33,490 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-15 05:43:33,490 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-15 05:43:33,490 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-15 05:43:33,490 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-15 05:43:33,491 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-15 05:43:33,491 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-15 05:43:33,491 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-15 05:43:33,492 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-15 05:43:33,492 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-15 05:43:33,492 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-15 05:43:33,492 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-15 05:43:33,493 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-15 05:43:33,493 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-15 05:43:33,493 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-15 05:43:33,493 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-15 05:43:33,494 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-15 05:43:33,494 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-15 05:43:33,494 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-15 05:43:33,495 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-15 05:43:33,495 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-15 05:43:33,495 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-15 05:43:33,495 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-15 05:43:33,496 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-15 05:43:33,496 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-15 05:43:33,496 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-15 05:43:33,496 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-15 05:43:33,497 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-15 05:43:33,497 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-15 05:43:33,497 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-15 05:43:33,498 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-15 05:43:33,498 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-15 05:43:33,498 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-15 05:43:33,498 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-15 05:43:33,499 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-15 05:43:33,499 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-15 05:43:33,499 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-15 05:43:33,500 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-15 05:43:33,500 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-15 05:43:33,500 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-15 05:43:33,500 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-15 05:43:33,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-15 05:43:33,501 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-15 05:43:33,501 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-15 05:43:33,501 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-15 05:43:33,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-15 05:43:33,502 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-15 05:43:33,502 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-15 05:43:33,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-15 05:43:33,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-15 05:43:33,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-15 05:43:33,503 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-15 05:43:33,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-15 05:43:33,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-15 05:43:33,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-15 05:43:33,504 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-15 05:43:33,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-15 05:43:33,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-15 05:43:33,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-15 05:43:33,506 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-15 05:43:33,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-15 05:43:33,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-15 05:43:33,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-15 05:43:33,507 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-15 05:43:33,507 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-15 05:43:33,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-15 05:43:33,508 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-15 05:43:33,508 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-15 05:43:33,508 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-15 05:43:33,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-15 05:43:33,509 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-15 05:43:33,509 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-15 05:43:33,509 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-15 05:43:33,509 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-15 05:43:33,510 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-15 05:43:33,510 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-15 05:43:33,510 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-15 05:43:33,510 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-15 05:43:33,511 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-15 05:43:33,511 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-15 05:43:33,511 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-15 05:43:33,511 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-15 05:43:33,512 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-15 05:43:33,512 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-15 05:43:33,512 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-15 05:43:33,512 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-15 05:43:33,512 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-15 05:43:33,513 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-15 05:43:33,513 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-15 05:43:33,513 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-15 05:43:33,513 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-15 05:43:33,514 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-15 05:43:33,514 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-15 05:43:33,514 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-15 05:43:33,514 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-15 05:43:33,515 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-15 05:43:33,515 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-15 05:43:33,515 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-15 05:43:33,515 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-15 05:43:33,516 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-15 05:43:33,516 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-15 05:43:33,516 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-15 05:43:33,516 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-15 05:43:33,517 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-15 05:43:33,517 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-15 05:43:33,517 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-15 05:43:33,517 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-15 05:43:33,518 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-15 05:43:33,518 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-15 05:43:33,518 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-15 05:43:33,518 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-15 05:43:33,519 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-15 05:43:33,519 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-15 05:43:33,519 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-15 05:43:33,519 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-15 05:43:33,519 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-15 05:43:33,520 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-15 05:43:33,520 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-15 05:43:33,520 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-15 05:43:33,520 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-15 05:43:33,521 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-15 05:43:33,521 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-15 05:43:33,521 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-15 05:43:33,521 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-15 05:43:33,522 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-15 05:43:33,522 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-15 05:43:33,522 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-15 05:43:33,522 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-15 05:43:33,523 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-15 05:43:33,523 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-15 05:43:33,523 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-15 05:43:33,523 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-15 05:43:33,524 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-15 05:43:33,524 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-15 05:43:33,524 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-15 05:43:33,524 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-15 05:43:33,525 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-15 05:43:33,525 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-15 05:43:33,525 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-15 05:43:33,525 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-15 05:43:33,526 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-15 05:43:33,526 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-15 05:43:33,526 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-15 05:43:33,526 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-15 05:43:33,526 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-15 05:43:33,527 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-15 05:43:33,527 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-15 05:43:33,527 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-15 05:43:33,527 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-15 05:43:33,528 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-15 05:43:33,528 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-15 05:43:33,528 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-15 05:43:33,528 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-15 05:43:33,529 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-15 05:43:33,529 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-15 05:43:33,530 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-15 05:43:33,530 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-15 05:43:33,530 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-15 05:43:33,531 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-15 05:43:33,531 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-15 05:43:33,531 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-15 05:43:33,532 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-15 05:43:33,532 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-15 05:43:33,532 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-15 05:43:33,532 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-15 05:43:33,533 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-15 05:43:33,533 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-15 05:43:33,533 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-15 05:43:33,534 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-15 05:43:33,534 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-15 05:43:33,534 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-15 05:43:33,534 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-15 05:43:33,534 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-15 05:43:33,534 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-15 05:43:33,534 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-15 05:43:33,534 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-15 05:43:33,535 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-15 05:43:33,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:33,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002523746] [2022-04-15 05:43:33,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002523746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:33,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287569750] [2022-04-15 05:43:33,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:43:33,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:33,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:33,536 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-15 05:43:33,537 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-15 05:43:34,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:43:34,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:43:34,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 2193 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 05:43:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:34,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:35,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53662#true} is VALID [2022-04-15 05:43:35,531 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-15 05:43:35,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-15 05:43:35,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-15 05:43:35,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-15 05:43:35,533 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-15 05:43:35,534 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-15 05:43:35,534 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-15 05:43:35,534 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-15 05:43:35,535 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-15 05:43:35,535 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-15 05:43:35,535 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-15 05:43:35,535 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-15 05:43:35,536 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-15 05:43:35,536 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-15 05:43:35,536 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-15 05:43:35,537 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-15 05:43:35,537 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-15 05:43:35,537 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-15 05:43:35,537 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-15 05:43:35,538 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-15 05:43:35,538 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-15 05:43:35,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:43:35,538 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-15 05:43:35,539 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-15 05:43:35,539 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-15 05:43:35,539 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-15 05:43:35,540 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-15 05:43:35,540 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-15 05:43:35,540 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-15 05:43:35,540 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-15 05:43:35,541 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-15 05:43:35,541 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-15 05:43:35,541 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-15 05:43:35,542 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-15 05:43:35,542 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-15 05:43:35,542 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-15 05:43:35,542 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-15 05:43:35,543 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-15 05:43:35,543 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-15 05:43:35,543 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-15 05:43:35,543 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-15 05:43:35,544 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-15 05:43:35,544 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-15 05:43:35,544 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-15 05:43:35,545 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-15 05:43:35,545 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-15 05:43:35,545 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-15 05:43:35,545 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-15 05:43:35,546 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-15 05:43:35,546 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-15 05:43:35,546 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-15 05:43:35,546 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-15 05:43:35,547 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-15 05:43:35,547 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-15 05:43:35,547 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-15 05:43:35,548 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-15 05:43:35,548 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-15 05:43:35,548 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-15 05:43:35,548 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-15 05:43:35,549 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-15 05:43:35,549 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-15 05:43:35,549 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-15 05:43:35,550 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-15 05:43:35,550 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-15 05:43:35,550 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-15 05:43:35,550 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-15 05:43:35,551 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-15 05:43:35,551 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-15 05:43:35,551 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-15 05:43:35,552 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-15 05:43:35,552 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-15 05:43:35,552 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-15 05:43:35,552 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-15 05:43:35,553 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-15 05:43:35,553 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-15 05:43:35,553 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-15 05:43:35,553 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-15 05:43:35,554 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-15 05:43:35,554 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-15 05:43:35,554 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-15 05:43:35,555 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-15 05:43:35,555 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-15 05:43:35,555 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-15 05:43:35,555 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-15 05:43:35,556 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-15 05:43:35,556 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-15 05:43:35,556 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-15 05:43:35,556 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-15 05:43:35,557 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-15 05:43:35,557 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-15 05:43:35,557 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-15 05:43:35,557 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-15 05:43:35,558 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-15 05:43:35,558 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-15 05:43:35,558 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-15 05:43:35,559 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-15 05:43:35,559 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-15 05:43:35,559 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-15 05:43:35,559 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-15 05:43:35,560 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-15 05:43:35,560 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-15 05:43:35,560 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-15 05:43:35,560 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-15 05:43:35,561 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-15 05:43:35,561 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-15 05:43:35,561 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-15 05:43:35,562 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-15 05:43:35,562 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-15 05:43:35,562 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-15 05:43:35,562 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-15 05:43:35,563 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-15 05:43:35,563 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-15 05:43:35,563 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-15 05:43:35,563 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-15 05:43:35,564 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-15 05:43:35,564 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-15 05:43:35,564 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-15 05:43:35,565 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-15 05:43:35,565 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-15 05:43:35,565 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-15 05:43:35,565 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-15 05:43:35,566 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-15 05:43:35,566 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-15 05:43:35,566 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-15 05:43:35,566 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-15 05:43:35,567 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-15 05:43:35,567 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-15 05:43:35,567 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-15 05:43:35,568 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-15 05:43:35,568 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-15 05:43:35,568 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-15 05:43:35,568 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-15 05:43:35,569 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-15 05:43:35,569 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-15 05:43:35,569 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-15 05:43:35,570 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-15 05:43:35,570 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-15 05:43:35,570 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-15 05:43:35,570 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-15 05:43:35,571 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-15 05:43:35,571 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-15 05:43:35,571 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-15 05:43:35,571 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-15 05:43:35,572 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-15 05:43:35,572 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-15 05:43:35,572 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-15 05:43:35,573 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-15 05:43:35,573 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-15 05:43:35,573 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-15 05:43:35,573 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-15 05:43:35,574 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-15 05:43:35,574 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-15 05:43:35,574 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-15 05:43:35,574 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-15 05:43:35,575 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-15 05:43:35,575 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-15 05:43:35,575 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-15 05:43:35,576 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-15 05:43:35,576 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-15 05:43:35,576 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-15 05:43:35,576 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-15 05:43:35,577 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-15 05:43:35,577 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-15 05:43:35,577 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-15 05:43:35,577 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-15 05:43:35,578 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-15 05:43:35,578 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-15 05:43:35,578 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-15 05:43:35,579 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-15 05:43:35,579 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-15 05:43:35,579 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-15 05:43:35,580 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-15 05:43:35,580 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-15 05:43:35,580 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-15 05:43:35,580 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-15 05:43:35,581 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-15 05:43:35,581 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-15 05:43:35,581 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-15 05:43:35,581 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-15 05:43:35,582 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-15 05:43:35,582 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-15 05:43:35,582 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-15 05:43:35,583 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-15 05:43:35,583 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-15 05:43:35,583 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-15 05:43:35,583 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-15 05:43:35,584 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-15 05:43:35,584 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-15 05:43:35,584 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-15 05:43:35,584 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-15 05:43:35,585 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-15 05:43:35,585 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-15 05:43:35,585 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-15 05:43:35,585 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-15 05:43:35,586 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-15 05:43:35,586 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-15 05:43:35,586 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-15 05:43:35,587 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-15 05:43:35,587 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-15 05:43:35,587 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-15 05:43:35,587 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-15 05:43:35,588 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-15 05:43:35,588 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-15 05:43:35,588 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-15 05:43:35,588 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-15 05:43:35,589 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-15 05:43:35,589 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-15 05:43:35,589 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-15 05:43:35,590 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-15 05:43:35,590 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-15 05:43:35,590 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-15 05:43:35,590 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-15 05:43:35,591 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-15 05:43:35,591 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-15 05:43:35,591 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-15 05:43:35,592 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-15 05:43:35,592 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-15 05:43:35,592 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-15 05:43:35,592 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-15 05:43:35,593 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-15 05:43:35,593 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-15 05:43:35,593 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-15 05:43:35,593 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-15 05:43:35,594 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-15 05:43:35,594 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-15 05:43:35,594 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-15 05:43:35,595 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-15 05:43:35,595 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-15 05:43:35,595 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-15 05:43:35,595 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-15 05:43:35,596 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-15 05:43:35,596 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-15 05:43:35,596 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-15 05:43:35,596 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-15 05:43:35,597 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-15 05:43:35,597 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-15 05:43:35,597 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-15 05:43:35,598 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-15 05:43:35,598 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-15 05:43:35,598 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-15 05:43:35,598 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-15 05:43:35,599 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-15 05:43:35,599 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-15 05:43:35,599 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-15 05:43:35,599 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-15 05:43:35,600 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-15 05:43:35,600 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-15 05:43:35,600 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-15 05:43:35,601 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-15 05:43:35,601 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-15 05:43:35,601 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-15 05:43:35,601 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-15 05:43:35,602 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-15 05:43:35,602 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-15 05:43:35,602 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-15 05:43:35,602 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-15 05:43:35,603 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-15 05:43:35,603 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-15 05:43:35,603 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-15 05:43:35,604 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-15 05:43:35,604 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-15 05:43:35,604 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-15 05:43:35,604 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-15 05:43:35,605 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-15 05:43:35,605 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-15 05:43:35,605 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-15 05:43:35,605 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-15 05:43:35,606 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-15 05:43:35,606 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-15 05:43:35,606 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-15 05:43:35,607 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-15 05:43:35,607 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-15 05:43:35,607 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-15 05:43:35,607 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-15 05:43:35,608 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-15 05:43:35,608 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-15 05:43:35,608 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-15 05:43:35,609 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-15 05:43:35,609 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-15 05:43:35,609 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-15 05:43:35,609 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-15 05:43:35,610 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-15 05:43:35,610 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-15 05:43:35,610 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-15 05:43:35,610 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-15 05:43:35,611 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-15 05:43:35,611 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-15 05:43:35,611 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-15 05:43:35,612 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-15 05:43:35,612 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-15 05:43:35,612 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-15 05:43:35,612 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-15 05:43:35,613 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-15 05:43:35,613 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-15 05:43:35,613 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-15 05:43:35,613 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-15 05:43:35,614 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-15 05:43:35,614 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-15 05:43:35,614 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-15 05:43:35,615 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-15 05:43:35,615 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-15 05:43:35,615 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-15 05:43:35,615 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-15 05:43:35,616 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-15 05:43:35,616 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-15 05:43:35,616 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-15 05:43:35,616 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-15 05:43:35,617 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-15 05:43:35,617 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-15 05:43:35,617 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-15 05:43:35,618 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-15 05:43:35,618 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-15 05:43:35,618 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-15 05:43:35,618 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-15 05:43:35,619 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-15 05:43:35,619 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-15 05:43:35,619 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-15 05:43:35,620 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-15 05:43:35,620 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-15 05:43:35,620 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-15 05:43:35,620 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-15 05:43:35,621 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-15 05:43:35,621 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-15 05:43:35,621 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-15 05:43:35,621 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-15 05:43:35,622 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-15 05:43:35,622 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-15 05:43:35,622 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-15 05:43:35,622 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-15 05:43:35,623 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-15 05:43:35,623 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-15 05:43:35,623 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-15 05:43:35,624 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-15 05:43:35,624 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-15 05:43:35,624 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-15 05:43:35,624 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-15 05:43:35,625 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-15 05:43:35,625 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-15 05:43:35,625 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-15 05:43:35,626 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-15 05:43:35,626 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-15 05:43:35,627 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-15 05:43:35,627 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-15 05:43:35,628 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-15 05:43:35,628 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-15 05:43:35,628 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-15 05:43:35,629 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-15 05:43:35,629 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-15 05:43:35,630 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-15 05:43:35,630 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-15 05:43:35,631 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-15 05:43:35,631 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-15 05:43:35,631 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-15 05:43:35,632 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-15 05:43:35,632 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-15 05:43:35,632 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-15 05:43:35,632 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-15 05:43:35,633 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-15 05:43:35,633 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-15 05:43:35,633 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-15 05:43:35,633 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-15 05:43:35,633 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-15 05:43:35,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:36,867 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-15 05:43:36,867 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-15 05:43:36,867 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-15 05:43:36,867 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-15 05:43:36,867 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-15 05:43:36,868 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-15 05:43:36,868 INFO L290 TraceCheckUtils]: 355: Hoare triple {54785#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {53663#false} is VALID [2022-04-15 05:43:36,868 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-15 05:43:36,868 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-15 05:43:36,869 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-15 05:43:36,869 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-15 05:43:36,869 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-15 05:43:36,870 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-15 05:43:36,870 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-15 05:43:36,870 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-15 05:43:36,871 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-15 05:43:36,871 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-15 05:43:36,871 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-15 05:43:36,871 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-15 05:43:36,872 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-15 05:43:36,872 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-15 05:43:36,873 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-15 05:43:36,873 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-15 05:43:36,873 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-15 05:43:36,873 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-15 05:43:36,874 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-15 05:43:36,874 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-15 05:43:36,874 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-15 05:43:36,874 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-15 05:43:36,875 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-15 05:43:36,875 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-15 05:43:36,875 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-15 05:43:36,875 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-15 05:43:36,876 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-15 05:43:36,876 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-15 05:43:36,876 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-15 05:43:36,876 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-15 05:43:36,877 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-15 05:43:36,877 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-15 05:43:36,877 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-15 05:43:36,877 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-15 05:43:36,878 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-15 05:43:36,878 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-15 05:43:36,878 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-15 05:43:36,878 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-15 05:43:36,879 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-15 05:43:36,879 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-15 05:43:36,879 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-15 05:43:36,879 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-15 05:43:36,880 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-15 05:43:36,880 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-15 05:43:36,880 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-15 05:43:36,880 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-15 05:43:36,881 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-15 05:43:36,881 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-15 05:43:36,881 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-15 05:43:36,881 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-15 05:43:36,882 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-15 05:43:36,882 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-15 05:43:36,882 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-15 05:43:36,882 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-15 05:43:36,883 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-15 05:43:36,883 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-15 05:43:36,883 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-15 05:43:36,883 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-15 05:43:36,884 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-15 05:43:36,884 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-15 05:43:36,884 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-15 05:43:36,884 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-15 05:43:36,885 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-15 05:43:36,885 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-15 05:43:36,885 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-15 05:43:36,885 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-15 05:43:36,886 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-15 05:43:36,886 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-15 05:43:36,886 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-15 05:43:36,886 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-15 05:43:36,887 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-15 05:43:36,887 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-15 05:43:36,887 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-15 05:43:36,887 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-15 05:43:36,888 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-15 05:43:36,888 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-15 05:43:36,888 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-15 05:43:36,888 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-15 05:43:36,889 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-15 05:43:36,889 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-15 05:43:36,889 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-15 05:43:36,889 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-15 05:43:36,890 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-15 05:43:36,890 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-15 05:43:36,890 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-15 05:43:36,890 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-15 05:43:36,891 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-15 05:43:36,891 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-15 05:43:36,891 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-15 05:43:36,891 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-15 05:43:36,892 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-15 05:43:36,892 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-15 05:43:36,892 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-15 05:43:36,892 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-15 05:43:36,893 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-15 05:43:36,893 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-15 05:43:36,893 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-15 05:43:36,893 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-15 05:43:36,894 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-15 05:43:36,894 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-15 05:43:36,894 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-15 05:43:36,894 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-15 05:43:36,895 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-15 05:43:36,895 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-15 05:43:36,895 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-15 05:43:36,895 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-15 05:43:36,896 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-15 05:43:36,896 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-15 05:43:36,896 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-15 05:43:36,896 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-15 05:43:36,897 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-15 05:43:36,897 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-15 05:43:36,897 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-15 05:43:36,897 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-15 05:43:36,898 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-15 05:43:36,898 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-15 05:43:36,898 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-15 05:43:36,898 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-15 05:43:36,899 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-15 05:43:36,899 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-15 05:43:36,899 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-15 05:43:36,899 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-15 05:43:36,900 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-15 05:43:36,900 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-15 05:43:36,900 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-15 05:43:36,900 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-15 05:43:36,901 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-15 05:43:36,901 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-15 05:43:36,901 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-15 05:43:36,901 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-15 05:43:36,902 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-15 05:43:36,902 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-15 05:43:36,902 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-15 05:43:36,902 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-15 05:43:36,903 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-15 05:43:36,903 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-15 05:43:36,903 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-15 05:43:36,903 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-15 05:43:36,904 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-15 05:43:36,904 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-15 05:43:36,904 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-15 05:43:36,905 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-15 05:43:36,905 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-15 05:43:36,905 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-15 05:43:36,905 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-15 05:43:36,906 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-15 05:43:36,906 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-15 05:43:36,906 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-15 05:43:36,906 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-15 05:43:36,907 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-15 05:43:36,907 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-15 05:43:36,907 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-15 05:43:36,907 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-15 05:43:36,908 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-15 05:43:36,908 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-15 05:43:36,908 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-15 05:43:36,908 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-15 05:43:36,909 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-15 05:43:36,909 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-15 05:43:36,909 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-15 05:43:36,909 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-15 05:43:36,910 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-15 05:43:36,910 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-15 05:43:36,910 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-15 05:43:36,910 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-15 05:43:36,911 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-15 05:43:36,911 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-15 05:43:36,911 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-15 05:43:36,911 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-15 05:43:36,912 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-15 05:43:36,912 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-15 05:43:36,912 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-15 05:43:36,912 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-15 05:43:36,913 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-15 05:43:36,913 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-15 05:43:36,913 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-15 05:43:36,914 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-15 05:43:36,914 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-15 05:43:36,914 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-15 05:43:36,914 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-15 05:43:36,915 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-15 05:43:36,915 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-15 05:43:36,915 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-15 05:43:36,915 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-15 05:43:36,916 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-15 05:43:36,916 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-15 05:43:36,916 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-15 05:43:36,916 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-15 05:43:36,916 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-15 05:43:36,917 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-15 05:43:36,917 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-15 05:43:36,917 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-15 05:43:36,917 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-15 05:43:36,918 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-15 05:43:36,918 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-15 05:43:36,918 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-15 05:43:36,918 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-15 05:43:36,919 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-15 05:43:36,919 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-15 05:43:36,919 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-15 05:43:36,919 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-15 05:43:36,920 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-15 05:43:36,920 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-15 05:43:36,920 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-15 05:43:36,920 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-15 05:43:36,921 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-15 05:43:36,921 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-15 05:43:36,921 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-15 05:43:36,921 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-15 05:43:36,922 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-15 05:43:36,922 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-15 05:43:36,922 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-15 05:43:36,922 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-15 05:43:36,923 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-15 05:43:36,923 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-15 05:43:36,923 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-15 05:43:36,924 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-15 05:43:36,924 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-15 05:43:36,924 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-15 05:43:36,924 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-15 05:43:36,925 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-15 05:43:36,925 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-15 05:43:36,925 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-15 05:43:36,925 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-15 05:43:36,926 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-15 05:43:36,926 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-15 05:43:36,926 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-15 05:43:36,926 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-15 05:43:36,927 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-15 05:43:36,927 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-15 05:43:36,927 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-15 05:43:36,927 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-15 05:43:36,928 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-15 05:43:36,928 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-15 05:43:36,928 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-15 05:43:36,928 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-15 05:43:36,929 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-15 05:43:36,929 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-15 05:43:36,929 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-15 05:43:36,929 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-15 05:43:36,930 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-15 05:43:36,930 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-15 05:43:36,930 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-15 05:43:36,930 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-15 05:43:36,931 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-15 05:43:36,931 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-15 05:43:36,931 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-15 05:43:36,931 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-15 05:43:36,932 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-15 05:43:36,932 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-15 05:43:36,932 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-15 05:43:36,932 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-15 05:43:36,933 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-15 05:43:36,933 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-15 05:43:36,933 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-15 05:43:36,933 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-15 05:43:36,934 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-15 05:43:36,934 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-15 05:43:36,934 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-15 05:43:36,934 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-15 05:43:36,935 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-15 05:43:36,935 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-15 05:43:36,935 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-15 05:43:36,935 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-15 05:43:36,936 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-15 05:43:36,936 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-15 05:43:36,936 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-15 05:43:36,936 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-15 05:43:36,937 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-15 05:43:36,937 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-15 05:43:36,937 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-15 05:43:36,937 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-15 05:43:36,938 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-15 05:43:36,938 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-15 05:43:36,938 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-15 05:43:36,938 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-15 05:43:36,939 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-15 05:43:36,939 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-15 05:43:36,939 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-15 05:43:36,939 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-15 05:43:36,940 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-15 05:43:36,940 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-15 05:43:36,940 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-15 05:43:36,940 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-15 05:43:36,941 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-15 05:43:36,941 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-15 05:43:36,941 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-15 05:43:36,941 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-15 05:43:36,942 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-15 05:43:36,942 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-15 05:43:36,942 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-15 05:43:36,942 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-15 05:43:36,943 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-15 05:43:36,943 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-15 05:43:36,943 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-15 05:43:36,943 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-15 05:43:36,944 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-15 05:43:36,944 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-15 05:43:36,944 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-15 05:43:36,944 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-15 05:43:36,945 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-15 05:43:36,945 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-15 05:43:36,945 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-15 05:43:36,945 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-15 05:43:36,946 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-15 05:43:36,946 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-15 05:43:36,946 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-15 05:43:36,946 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-15 05:43:36,947 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-15 05:43:36,947 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-15 05:43:36,947 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-15 05:43:36,947 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-15 05:43:36,948 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-15 05:43:36,948 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-15 05:43:36,948 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-15 05:43:36,948 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-15 05:43:36,949 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-15 05:43:36,949 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-15 05:43:36,949 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-15 05:43:36,949 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-15 05:43:36,950 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-15 05:43:36,950 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-15 05:43:36,950 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-15 05:43:36,950 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-15 05:43:36,951 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-15 05:43:36,951 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-15 05:43:36,951 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-15 05:43:36,951 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-15 05:43:36,952 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-15 05:43:36,952 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-15 05:43:36,952 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-15 05:43:36,952 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-15 05:43:36,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {54839#(< 5 main_~edgecount~0)} ~i~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-15 05:43:36,953 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-15 05:43:36,953 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-15 05:43:36,953 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-15 05:43:36,954 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-15 05:43:36,954 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-15 05:43:36,954 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-15 05:43:36,954 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-15 05:43:36,955 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-15 05:43:36,955 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-15 05:43:36,955 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-15 05:43:36,955 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-15 05:43:36,956 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-15 05:43:36,956 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-15 05:43:36,956 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-15 05:43:36,956 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-15 05:43:36,957 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-15 05:43:36,958 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-15 05:43:36,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-15 05:43:36,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-15 05:43:36,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-15 05:43:36,959 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-15 05:43:36,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53662#true} is VALID [2022-04-15 05:43:36,959 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-15 05:43:36,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287569750] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:36,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:36,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-04-15 05:43:36,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:36,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286205401] [2022-04-15 05:43:36,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286205401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:36,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:36,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:43:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503547953] [2022-04-15 05:43:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:36,961 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-15 05:43:36,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:36,961 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-15 05:43:36,987 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-15 05:43:36,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:43:36,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:36,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:43:36,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=305, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:43:36,988 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-15 05:43:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:40,007 INFO L93 Difference]: Finished difference Result 539 states and 699 transitions. [2022-04-15 05:43:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:43:40,008 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-15 05:43:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:40,008 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-15 05:43:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-04-15 05:43:40,009 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-15 05:43:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-04-15 05:43:40,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 160 transitions. [2022-04-15 05:43:40,143 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-15 05:43:40,158 INFO L225 Difference]: With dead ends: 539 [2022-04-15 05:43:40,158 INFO L226 Difference]: Without dead ends: 528 [2022-04-15 05:43:40,158 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-15 05:43:40,159 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-15 05:43:40,159 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-15 05:43:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-04-15 05:43:41,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 370. [2022-04-15 05:43:41,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:41,813 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-15 05:43:41,813 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-15 05:43:41,813 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-15 05:43:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:41,823 INFO L93 Difference]: Finished difference Result 528 states and 687 transitions. [2022-04-15 05:43:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 687 transitions. [2022-04-15 05:43:41,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:41,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:41,824 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-15 05:43:41,824 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-15 05:43:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:41,853 INFO L93 Difference]: Finished difference Result 528 states and 687 transitions. [2022-04-15 05:43:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 687 transitions. [2022-04-15 05:43:41,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:41,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:41,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:41,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:41,854 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-15 05:43:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 479 transitions. [2022-04-15 05:43:41,864 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 479 transitions. Word has length 362 [2022-04-15 05:43:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:41,864 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 479 transitions. [2022-04-15 05:43:41,865 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-15 05:43:41,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 370 states and 479 transitions. [2022-04-15 05:43:42,712 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-15 05:43:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 479 transitions. [2022-04-15 05:43:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2022-04-15 05:43:42,714 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:42,714 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-15 05:43:42,735 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-15 05:43:42,915 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-15 05:43:42,915 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash 952532282, now seen corresponding path program 63 times [2022-04-15 05:43:42,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:42,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1183933042] [2022-04-15 05:43:42,920 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:42,920 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:42,920 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:42,920 INFO L85 PathProgramCache]: Analyzing trace with hash 952532282, now seen corresponding path program 64 times [2022-04-15 05:43:42,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:42,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419291795] [2022-04-15 05:43:42,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:42,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:43,368 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-15 05:43:43,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-15 05:43:43,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-15 05:43:43,369 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-15 05:43:43,369 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-15 05:43:43,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-15 05:43:43,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-15 05:43:43,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-15 05:43:43,370 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-15 05:43:43,371 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-15 05:43:43,371 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-15 05:43:43,371 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-15 05:43:43,372 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-15 05:43:43,372 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-15 05:43:43,372 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-15 05:43:43,372 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-15 05:43:43,373 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-15 05:43:43,373 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-15 05:43:43,373 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-15 05:43:43,373 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-15 05:43:43,374 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-15 05:43:43,374 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-15 05:43:43,374 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-15 05:43:43,374 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-15 05:43:43,375 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-15 05:43:43,375 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-15 05:43:43,375 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-15 05:43:43,376 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-15 05:43:43,376 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-15 05:43:43,376 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-15 05:43:43,376 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-15 05:43:43,377 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-15 05:43:43,377 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-15 05:43:43,377 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-15 05:43:43,378 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-15 05:43:43,378 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-15 05:43:43,378 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-15 05:43:43,378 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-15 05:43:43,379 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-15 05:43:43,379 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-15 05:43:43,379 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-15 05:43:43,379 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-15 05:43:43,380 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-15 05:43:43,380 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-15 05:43:43,380 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-15 05:43:43,381 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-15 05:43:43,381 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-15 05:43:43,381 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-15 05:43:43,381 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-15 05:43:43,382 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-15 05:43:43,382 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-15 05:43:43,382 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-15 05:43:43,382 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-15 05:43:43,383 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-15 05:43:43,383 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-15 05:43:43,383 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-15 05:43:43,383 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-15 05:43:43,384 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-15 05:43:43,384 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-15 05:43:43,384 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-15 05:43:43,384 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-15 05:43:43,385 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-15 05:43:43,385 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-15 05:43:43,385 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-15 05:43:43,385 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-15 05:43:43,386 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-15 05:43:43,386 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-15 05:43:43,386 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-15 05:43:43,386 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-15 05:43:43,387 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-15 05:43:43,387 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-15 05:43:43,387 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-15 05:43:43,388 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-15 05:43:43,388 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-15 05:43:43,388 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-15 05:43:43,388 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-15 05:43:43,389 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-15 05:43:43,389 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-15 05:43:43,389 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-15 05:43:43,390 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-15 05:43:43,390 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-15 05:43:43,390 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-15 05:43:43,390 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-15 05:43:43,391 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-15 05:43:43,391 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-15 05:43:43,391 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-15 05:43:43,392 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-15 05:43:43,392 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-15 05:43:43,392 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-15 05:43:43,392 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-15 05:43:43,393 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-15 05:43:43,393 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-15 05:43:43,394 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-15 05:43:43,394 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-15 05:43:43,394 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-15 05:43:43,394 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-15 05:43:43,395 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-15 05:43:43,395 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-15 05:43:43,395 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-15 05:43:43,395 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-15 05:43:43,396 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-15 05:43:43,396 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-15 05:43:43,396 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-15 05:43:43,397 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-15 05:43:43,397 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-15 05:43:43,397 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-15 05:43:43,397 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-15 05:43:43,398 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-15 05:43:43,398 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-15 05:43:43,398 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-15 05:43:43,398 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-15 05:43:43,399 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-15 05:43:43,399 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-15 05:43:43,399 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-15 05:43:43,400 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-15 05:43:43,400 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-15 05:43:43,400 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-15 05:43:43,400 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-15 05:43:43,401 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-15 05:43:43,401 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-15 05:43:43,401 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-15 05:43:43,401 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-15 05:43:43,402 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-15 05:43:43,402 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-15 05:43:43,402 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-15 05:43:43,402 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-15 05:43:43,403 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-15 05:43:43,403 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-15 05:43:43,403 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-15 05:43:43,403 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-15 05:43:43,404 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-15 05:43:43,404 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-15 05:43:43,404 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-15 05:43:43,405 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-15 05:43:43,405 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-15 05:43:43,405 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-15 05:43:43,405 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-15 05:43:43,406 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-15 05:43:43,406 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-15 05:43:43,406 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-15 05:43:43,406 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-15 05:43:43,407 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-15 05:43:43,407 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-15 05:43:43,407 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-15 05:43:43,408 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-15 05:43:43,408 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-15 05:43:43,408 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-15 05:43:43,408 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-15 05:43:43,409 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-15 05:43:43,409 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-15 05:43:43,409 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-15 05:43:43,409 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-15 05:43:43,410 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-15 05:43:43,410 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-15 05:43:43,410 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-15 05:43:43,411 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-15 05:43:43,411 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-15 05:43:43,411 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-15 05:43:43,412 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-15 05:43:43,412 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-15 05:43:43,412 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-15 05:43:43,412 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-15 05:43:43,413 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-15 05:43:43,413 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-15 05:43:43,413 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-15 05:43:43,413 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-15 05:43:43,414 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-15 05:43:43,414 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-15 05:43:43,414 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-15 05:43:43,415 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-15 05:43:43,415 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-15 05:43:43,415 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-15 05:43:43,415 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-15 05:43:43,416 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-15 05:43:43,416 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-15 05:43:43,416 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-15 05:43:43,416 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-15 05:43:43,417 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-15 05:43:43,417 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-15 05:43:43,417 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-15 05:43:43,418 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-15 05:43:43,418 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-15 05:43:43,418 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-15 05:43:43,418 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-15 05:43:43,419 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-15 05:43:43,419 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-15 05:43:43,419 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-15 05:43:43,420 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-15 05:43:43,420 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-15 05:43:43,420 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-15 05:43:43,420 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-15 05:43:43,421 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-15 05:43:43,421 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-15 05:43:43,421 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-15 05:43:43,421 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-15 05:43:43,422 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-15 05:43:43,422 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-15 05:43:43,422 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-15 05:43:43,422 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-15 05:43:43,423 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-15 05:43:43,423 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-15 05:43:43,423 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-15 05:43:43,423 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-15 05:43:43,424 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-15 05:43:43,424 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-15 05:43:43,424 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-15 05:43:43,424 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-15 05:43:43,425 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-15 05:43:43,425 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-15 05:43:43,425 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-15 05:43:43,425 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-15 05:43:43,426 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-15 05:43:43,426 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-15 05:43:43,426 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-15 05:43:43,426 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-15 05:43:43,427 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-15 05:43:43,427 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-15 05:43:43,427 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-15 05:43:43,427 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-15 05:43:43,428 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-15 05:43:43,428 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-15 05:43:43,428 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-15 05:43:43,428 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-15 05:43:43,428 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-15 05:43:43,429 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-15 05:43:43,429 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-15 05:43:43,429 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-15 05:43:43,429 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-15 05:43:43,430 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-15 05:43:43,430 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-15 05:43:43,430 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-15 05:43:43,431 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-15 05:43:43,431 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-15 05:43:43,431 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-15 05:43:43,431 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-15 05:43:43,432 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-15 05:43:43,432 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-15 05:43:43,432 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-15 05:43:43,432 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-15 05:43:43,433 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-15 05:43:43,433 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-15 05:43:43,433 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-15 05:43:43,433 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-15 05:43:43,434 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-15 05:43:43,434 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-15 05:43:43,434 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-15 05:43:43,434 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-15 05:43:43,435 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-15 05:43:43,435 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-15 05:43:43,435 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-15 05:43:43,435 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-15 05:43:43,436 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-15 05:43:43,436 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-15 05:43:43,436 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-15 05:43:43,436 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-15 05:43:43,437 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-15 05:43:43,437 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-15 05:43:43,437 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-15 05:43:43,437 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-15 05:43:43,437 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-15 05:43:43,438 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-15 05:43:43,438 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-15 05:43:43,438 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-15 05:43:43,438 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-15 05:43:43,439 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-15 05:43:43,439 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-15 05:43:43,439 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-15 05:43:43,439 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-15 05:43:43,440 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-15 05:43:43,440 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-15 05:43:43,440 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-15 05:43:43,440 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-15 05:43:43,441 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-15 05:43:43,441 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-15 05:43:43,441 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-15 05:43:43,441 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-15 05:43:43,442 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-15 05:43:43,442 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-15 05:43:43,442 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-15 05:43:43,442 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-15 05:43:43,443 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-15 05:43:43,443 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-15 05:43:43,443 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-15 05:43:43,443 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-15 05:43:43,444 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-15 05:43:43,444 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-15 05:43:43,444 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-15 05:43:43,444 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-15 05:43:43,445 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-15 05:43:43,445 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-15 05:43:43,445 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-15 05:43:43,445 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-15 05:43:43,446 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-15 05:43:43,446 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-15 05:43:43,446 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-15 05:43:43,446 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-15 05:43:43,447 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-15 05:43:43,447 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-15 05:43:43,447 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-15 05:43:43,447 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-15 05:43:43,448 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-15 05:43:43,448 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-15 05:43:43,448 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-15 05:43:43,448 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-15 05:43:43,449 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-15 05:43:43,449 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-15 05:43:43,449 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-15 05:43:43,449 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-15 05:43:43,450 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-15 05:43:43,450 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-15 05:43:43,450 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-15 05:43:43,450 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-15 05:43:43,451 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-15 05:43:43,451 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-15 05:43:43,451 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-15 05:43:43,452 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-15 05:43:43,452 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-15 05:43:43,452 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-15 05:43:43,453 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-15 05:43:43,453 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-15 05:43:43,453 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-15 05:43:43,454 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-15 05:43:43,454 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-15 05:43:43,454 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-15 05:43:43,455 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-15 05:43:43,455 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-15 05:43:43,455 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-15 05:43:43,455 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-15 05:43:43,456 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-15 05:43:43,456 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-15 05:43:43,456 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-15 05:43:43,456 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-15 05:43:43,457 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-15 05:43:43,457 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-15 05:43:43,457 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-15 05:43:43,458 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-15 05:43:43,458 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-15 05:43:43,458 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-15 05:43:43,458 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-15 05:43:43,459 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-15 05:43:43,459 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-15 05:43:43,459 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-15 05:43:43,460 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-15 05:43:43,460 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-15 05:43:43,460 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-15 05:43:43,461 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-15 05:43:43,461 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-15 05:43:43,462 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-15 05:43:43,462 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-15 05:43:43,463 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-15 05:43:43,463 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-15 05:43:43,464 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-15 05:43:43,464 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-15 05:43:43,464 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-15 05:43:43,465 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-15 05:43:43,465 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-15 05:43:43,466 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-15 05:43:43,466 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-15 05:43:43,467 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-15 05:43:43,467 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-15 05:43:43,468 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-15 05:43:43,468 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-15 05:43:43,468 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-15 05:43:43,468 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-15 05:43:43,468 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-15 05:43:43,468 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-15 05:43:43,468 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-15 05:43:43,468 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-15 05:43:43,469 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-15 05:43:43,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:43,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419291795] [2022-04-15 05:43:43,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419291795] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:43,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997915137] [2022-04-15 05:43:43,469 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:43:43,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:43,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:43,470 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-15 05:43:43,471 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-15 05:43:44,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:43:44,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:43:44,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 05:43:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:44,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:45,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58747#true} is VALID [2022-04-15 05:43:45,628 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-15 05:43:45,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-15 05:43:45,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-15 05:43:45,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-15 05:43:45,628 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-15 05:43:45,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:45,628 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-15 05:43:45,628 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-15 05:43:45,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:45,628 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-15 05:43:45,629 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-15 05:43:45,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:45,629 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-15 05:43:45,629 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-15 05:43:45,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:45,629 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-15 05:43:45,629 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-15 05:43:45,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:45,629 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-15 05:43:45,629 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-15 05:43:45,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {58747#true} assume !(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:45,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {58747#true} ~i~0 := 0; {58747#true} is VALID [2022-04-15 05:43:45,630 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-15 05:43:45,630 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-15 05:43:45,630 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-15 05:43:45,630 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-15 05:43:45,631 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-15 05:43:45,631 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-15 05:43:45,631 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-15 05:43:45,632 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-15 05:43:45,632 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-15 05:43:45,632 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-15 05:43:45,632 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-15 05:43:45,633 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-15 05:43:45,633 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-15 05:43:45,633 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-15 05:43:45,634 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-15 05:43:45,634 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-15 05:43:45,634 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-15 05:43:45,634 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-15 05:43:45,635 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-15 05:43:45,635 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-15 05:43:45,635 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-15 05:43:45,636 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-15 05:43:45,636 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-15 05:43:45,636 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-15 05:43:45,636 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-15 05:43:45,637 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-15 05:43:45,637 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-15 05:43:45,637 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-15 05:43:45,638 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-15 05:43:45,638 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-15 05:43:45,638 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-15 05:43:45,638 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-15 05:43:45,639 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-15 05:43:45,639 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-15 05:43:45,639 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-15 05:43:45,640 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-15 05:43:45,640 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-15 05:43:45,640 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-15 05:43:45,640 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-15 05:43:45,641 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-15 05:43:45,641 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-15 05:43:45,641 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-15 05:43:45,642 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-15 05:43:45,642 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-15 05:43:45,642 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-15 05:43:45,643 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-15 05:43:45,643 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-15 05:43:45,643 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-15 05:43:45,643 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-15 05:43:45,644 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-15 05:43:45,644 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-15 05:43:45,644 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-15 05:43:45,644 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-15 05:43:45,645 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-15 05:43:45,645 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-15 05:43:45,645 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-15 05:43:45,646 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-15 05:43:45,646 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-15 05:43:45,646 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-15 05:43:45,647 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-15 05:43:45,647 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-15 05:43:45,647 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-15 05:43:45,647 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-15 05:43:45,648 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-15 05:43:45,648 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-15 05:43:45,648 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-15 05:43:45,648 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-15 05:43:45,649 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-15 05:43:45,649 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-15 05:43:45,649 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-15 05:43:45,649 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-15 05:43:45,650 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-15 05:43:45,650 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-15 05:43:45,650 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-15 05:43:45,650 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-15 05:43:45,651 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-15 05:43:45,651 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-15 05:43:45,651 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-15 05:43:45,651 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-15 05:43:45,652 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-15 05:43:45,652 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-15 05:43:45,652 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-15 05:43:45,652 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-15 05:43:45,653 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-15 05:43:45,653 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-15 05:43:45,653 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-15 05:43:45,653 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-15 05:43:45,654 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-15 05:43:45,654 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-15 05:43:45,654 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-15 05:43:45,654 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-15 05:43:45,655 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-15 05:43:45,655 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-15 05:43:45,655 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-15 05:43:45,656 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-15 05:43:45,656 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-15 05:43:45,656 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-15 05:43:45,656 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-15 05:43:45,657 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-15 05:43:45,657 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-15 05:43:45,657 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-15 05:43:45,657 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-15 05:43:45,658 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-15 05:43:45,658 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-15 05:43:45,658 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-15 05:43:45,658 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-15 05:43:45,658 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-15 05:43:45,659 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-15 05:43:45,659 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-15 05:43:45,659 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-15 05:43:45,659 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-15 05:43:45,660 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-15 05:43:45,660 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-15 05:43:45,660 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-15 05:43:45,660 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-15 05:43:45,661 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-15 05:43:45,661 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-15 05:43:45,661 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-15 05:43:45,661 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-15 05:43:45,662 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-15 05:43:45,662 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-15 05:43:45,662 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-15 05:43:45,662 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-15 05:43:45,663 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-15 05:43:45,663 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-15 05:43:45,663 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-15 05:43:45,663 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-15 05:43:45,664 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-15 05:43:45,664 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-15 05:43:45,664 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-15 05:43:45,664 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-15 05:43:45,665 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-15 05:43:45,665 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-15 05:43:45,665 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-15 05:43:45,665 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-15 05:43:45,666 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-15 05:43:45,666 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-15 05:43:45,666 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-15 05:43:45,666 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-15 05:43:45,667 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-15 05:43:45,667 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-15 05:43:45,667 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-15 05:43:45,667 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-15 05:43:45,668 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-15 05:43:45,668 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-15 05:43:45,668 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-15 05:43:45,668 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-15 05:43:45,669 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-15 05:43:45,669 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-15 05:43:45,669 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-15 05:43:45,669 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-15 05:43:45,670 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-15 05:43:45,670 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-15 05:43:45,670 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-15 05:43:45,670 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-15 05:43:45,671 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-15 05:43:45,671 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-15 05:43:45,671 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-15 05:43:45,671 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-15 05:43:45,672 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-15 05:43:45,672 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-15 05:43:45,672 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-15 05:43:45,672 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-15 05:43:45,673 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-15 05:43:45,673 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-15 05:43:45,673 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-15 05:43:45,673 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-15 05:43:45,674 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-15 05:43:45,674 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-15 05:43:45,674 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-15 05:43:45,674 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-15 05:43:45,675 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-15 05:43:45,675 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-15 05:43:45,675 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-15 05:43:45,675 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-15 05:43:45,676 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-15 05:43:45,676 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-15 05:43:45,676 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-15 05:43:45,676 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-15 05:43:45,677 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-15 05:43:45,678 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-15 05:43:45,678 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-15 05:43:45,678 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-15 05:43:45,678 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-15 05:43:45,679 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-15 05:43:45,679 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-15 05:43:45,679 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-15 05:43:45,679 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-15 05:43:45,680 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-15 05:43:45,680 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-15 05:43:45,680 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-15 05:43:45,680 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-15 05:43:45,681 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-15 05:43:45,681 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-15 05:43:45,681 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-15 05:43:45,681 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-15 05:43:45,682 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-15 05:43:45,682 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-15 05:43:45,682 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-15 05:43:45,682 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-15 05:43:45,683 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-15 05:43:45,683 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-15 05:43:45,683 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-15 05:43:45,683 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-15 05:43:45,684 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-15 05:43:45,684 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-15 05:43:45,684 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-15 05:43:45,684 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-15 05:43:45,685 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-15 05:43:45,685 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-15 05:43:45,685 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-15 05:43:45,685 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-15 05:43:45,686 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-15 05:43:45,686 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-15 05:43:45,686 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-15 05:43:45,686 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-15 05:43:45,687 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-15 05:43:45,687 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-15 05:43:45,687 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-15 05:43:45,687 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-15 05:43:45,688 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-15 05:43:45,688 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-15 05:43:45,688 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-15 05:43:45,688 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-15 05:43:45,688 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-15 05:43:45,689 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-15 05:43:45,689 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-15 05:43:45,689 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-15 05:43:45,689 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-15 05:43:45,690 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-15 05:43:45,690 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-15 05:43:45,690 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-15 05:43:45,690 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-15 05:43:45,691 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-15 05:43:45,691 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-15 05:43:45,691 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-15 05:43:45,691 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-15 05:43:45,692 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-15 05:43:45,692 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-15 05:43:45,692 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-15 05:43:45,692 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-15 05:43:45,693 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-15 05:43:45,693 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-15 05:43:45,693 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-15 05:43:45,693 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-15 05:43:45,694 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-15 05:43:45,694 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-15 05:43:45,694 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-15 05:43:45,694 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-15 05:43:45,695 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-15 05:43:45,695 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-15 05:43:45,695 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-15 05:43:45,695 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-15 05:43:45,696 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-15 05:43:45,696 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-15 05:43:45,696 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-15 05:43:45,696 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-15 05:43:45,697 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-15 05:43:45,697 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-15 05:43:45,697 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-15 05:43:45,697 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-15 05:43:45,698 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-15 05:43:45,698 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-15 05:43:45,698 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-15 05:43:45,698 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-15 05:43:45,699 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-15 05:43:45,699 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-15 05:43:45,699 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-15 05:43:45,699 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-15 05:43:45,700 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-15 05:43:45,700 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-15 05:43:45,700 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-15 05:43:45,700 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-15 05:43:45,700 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-15 05:43:45,701 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-15 05:43:45,701 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-15 05:43:45,701 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-15 05:43:45,701 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-15 05:43:45,702 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-15 05:43:45,702 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-15 05:43:45,702 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-15 05:43:45,702 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-15 05:43:45,703 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-15 05:43:45,703 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-15 05:43:45,703 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-15 05:43:45,703 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-15 05:43:45,704 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-15 05:43:45,704 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-15 05:43:45,704 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-15 05:43:45,704 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-15 05:43:45,705 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-15 05:43:45,705 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-15 05:43:45,705 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-15 05:43:45,705 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-15 05:43:45,706 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-15 05:43:45,706 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-15 05:43:45,706 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-15 05:43:45,706 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-15 05:43:45,707 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-15 05:43:45,707 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-15 05:43:45,707 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-15 05:43:45,707 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-15 05:43:45,708 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-15 05:43:45,708 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-15 05:43:45,708 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-15 05:43:45,708 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-15 05:43:45,709 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-15 05:43:45,709 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-15 05:43:45,709 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-15 05:43:45,710 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-15 05:43:45,710 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-15 05:43:45,710 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-15 05:43:45,710 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-15 05:43:45,711 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-15 05:43:45,711 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-15 05:43:45,711 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-15 05:43:45,711 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-15 05:43:45,712 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-15 05:43:45,712 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-15 05:43:45,713 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-15 05:43:45,713 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-15 05:43:45,713 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-15 05:43:45,714 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-15 05:43:45,714 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-15 05:43:45,714 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-15 05:43:45,715 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-15 05:43:45,715 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-15 05:43:45,716 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-15 05:43:45,716 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-15 05:43:45,716 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-15 05:43:45,717 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-15 05:43:45,717 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-15 05:43:45,717 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-15 05:43:45,718 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-15 05:43:45,718 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-15 05:43:45,718 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-15 05:43:45,719 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-15 05:43:45,719 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-15 05:43:45,719 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-15 05:43:45,719 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-15 05:43:45,719 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-15 05:43:45,719 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-15 05:43:45,720 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-15 05:43:45,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:47,139 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-15 05:43:47,139 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-15 05:43:47,139 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-15 05:43:47,139 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-15 05:43:47,139 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-15 05:43:47,139 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-15 05:43:47,140 INFO L290 TraceCheckUtils]: 358: Hoare triple {59902#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {58748#false} is VALID [2022-04-15 05:43:47,140 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-15 05:43:47,140 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-15 05:43:47,141 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-15 05:43:47,141 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-15 05:43:47,141 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-15 05:43:47,142 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-15 05:43:47,142 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-15 05:43:47,142 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-15 05:43:47,143 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-15 05:43:47,143 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-15 05:43:47,143 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-15 05:43:47,144 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-15 05:43:47,144 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-15 05:43:47,144 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-15 05:43:47,145 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-15 05:43:47,145 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-15 05:43:47,146 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-15 05:43:47,146 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-15 05:43:47,146 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-15 05:43:47,146 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-15 05:43:47,147 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-15 05:43:47,147 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-15 05:43:47,147 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-15 05:43:47,148 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-15 05:43:47,148 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-15 05:43:47,148 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-15 05:43:47,148 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-15 05:43:47,149 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-15 05:43:47,149 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-15 05:43:47,149 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-15 05:43:47,150 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-15 05:43:47,150 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-15 05:43:47,150 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-15 05:43:47,150 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-15 05:43:47,151 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-15 05:43:47,151 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-15 05:43:47,151 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-15 05:43:47,151 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-15 05:43:47,152 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-15 05:43:47,152 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-15 05:43:47,152 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-15 05:43:47,152 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-15 05:43:47,153 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-15 05:43:47,153 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-15 05:43:47,153 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-15 05:43:47,154 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-15 05:43:47,154 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-15 05:43:47,154 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-15 05:43:47,154 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-15 05:43:47,155 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-15 05:43:47,155 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-15 05:43:47,155 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-15 05:43:47,155 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-15 05:43:47,156 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-15 05:43:47,156 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-15 05:43:47,156 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-15 05:43:47,156 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-15 05:43:47,157 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-15 05:43:47,157 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-15 05:43:47,157 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-15 05:43:47,158 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-15 05:43:47,158 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-15 05:43:47,158 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-15 05:43:47,158 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-15 05:43:47,159 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-15 05:43:47,159 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-15 05:43:47,159 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-15 05:43:47,159 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-15 05:43:47,160 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-15 05:43:47,160 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-15 05:43:47,160 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-15 05:43:47,161 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-15 05:43:47,161 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-15 05:43:47,161 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-15 05:43:47,161 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-15 05:43:47,162 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-15 05:43:47,162 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-15 05:43:47,162 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-15 05:43:47,162 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-15 05:43:47,163 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-15 05:43:47,163 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-15 05:43:47,163 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-15 05:43:47,163 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-15 05:43:47,164 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-15 05:43:47,164 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-15 05:43:47,164 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-15 05:43:47,165 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-15 05:43:47,165 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-15 05:43:47,165 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-15 05:43:47,165 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-15 05:43:47,166 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-15 05:43:47,166 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-15 05:43:47,166 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-15 05:43:47,166 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-15 05:43:47,167 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-15 05:43:47,167 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-15 05:43:47,167 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-15 05:43:47,168 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-15 05:43:47,168 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-15 05:43:47,168 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-15 05:43:47,168 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-15 05:43:47,169 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-15 05:43:47,169 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-15 05:43:47,169 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-15 05:43:47,169 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-15 05:43:47,170 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-15 05:43:47,170 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-15 05:43:47,170 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-15 05:43:47,170 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-15 05:43:47,171 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-15 05:43:47,171 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-15 05:43:47,171 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-15 05:43:47,172 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-15 05:43:47,172 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-15 05:43:47,172 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-15 05:43:47,172 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-15 05:43:47,173 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-15 05:43:47,173 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-15 05:43:47,173 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-15 05:43:47,173 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-15 05:43:47,174 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-15 05:43:47,174 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-15 05:43:47,174 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-15 05:43:47,175 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-15 05:43:47,175 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-15 05:43:47,175 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-15 05:43:47,175 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-15 05:43:47,176 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-15 05:43:47,176 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-15 05:43:47,176 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-15 05:43:47,176 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-15 05:43:47,177 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-15 05:43:47,177 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-15 05:43:47,177 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-15 05:43:47,178 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-15 05:43:47,178 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-15 05:43:47,178 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-15 05:43:47,178 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-15 05:43:47,179 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-15 05:43:47,179 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-15 05:43:47,179 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-15 05:43:47,179 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-15 05:43:47,180 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-15 05:43:47,180 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-15 05:43:47,180 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-15 05:43:47,180 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-15 05:43:47,181 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-15 05:43:47,181 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-15 05:43:47,181 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-15 05:43:47,182 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-15 05:43:47,182 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-15 05:43:47,182 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-15 05:43:47,182 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-15 05:43:47,183 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-15 05:43:47,183 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-15 05:43:47,183 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-15 05:43:47,183 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-15 05:43:47,184 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-15 05:43:47,184 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-15 05:43:47,184 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-15 05:43:47,184 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-15 05:43:47,185 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-15 05:43:47,185 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-15 05:43:47,185 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-15 05:43:47,186 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-15 05:43:47,186 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-15 05:43:47,186 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-15 05:43:47,186 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-15 05:43:47,187 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-15 05:43:47,187 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-15 05:43:47,187 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-15 05:43:47,187 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-15 05:43:47,188 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-15 05:43:47,188 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-15 05:43:47,188 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-15 05:43:47,188 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-15 05:43:47,189 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-15 05:43:47,189 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-15 05:43:47,189 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-15 05:43:47,190 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-15 05:43:47,190 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-15 05:43:47,190 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-15 05:43:47,190 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-15 05:43:47,191 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-15 05:43:47,191 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-15 05:43:47,191 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-15 05:43:47,191 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-15 05:43:47,192 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-15 05:43:47,192 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-15 05:43:47,192 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-15 05:43:47,193 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-15 05:43:47,193 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-15 05:43:47,193 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-15 05:43:47,193 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-15 05:43:47,194 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-15 05:43:47,194 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-15 05:43:47,194 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-15 05:43:47,194 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-15 05:43:47,195 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-15 05:43:47,195 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-15 05:43:47,195 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-15 05:43:47,196 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-15 05:43:47,196 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-15 05:43:47,196 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-15 05:43:47,196 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-15 05:43:47,197 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-15 05:43:47,197 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-15 05:43:47,197 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-15 05:43:47,197 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-15 05:43:47,198 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-15 05:43:47,198 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-15 05:43:47,198 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-15 05:43:47,198 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-15 05:43:47,199 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-15 05:43:47,199 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-15 05:43:47,199 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-15 05:43:47,200 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-15 05:43:47,200 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-15 05:43:47,200 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-15 05:43:47,200 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-15 05:43:47,201 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-15 05:43:47,201 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-15 05:43:47,201 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-15 05:43:47,201 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-15 05:43:47,202 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-15 05:43:47,202 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-15 05:43:47,202 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-15 05:43:47,203 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-15 05:43:47,203 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-15 05:43:47,203 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-15 05:43:47,203 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-15 05:43:47,204 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-15 05:43:47,204 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-15 05:43:47,204 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-15 05:43:47,204 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-15 05:43:47,205 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-15 05:43:47,205 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-15 05:43:47,205 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-15 05:43:47,206 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-15 05:43:47,206 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-15 05:43:47,206 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-15 05:43:47,206 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-15 05:43:47,207 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-15 05:43:47,207 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-15 05:43:47,207 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-15 05:43:47,207 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-15 05:43:47,208 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-15 05:43:47,208 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-15 05:43:47,208 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-15 05:43:47,209 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-15 05:43:47,209 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-15 05:43:47,209 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-15 05:43:47,209 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-15 05:43:47,210 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-15 05:43:47,210 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-15 05:43:47,210 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-15 05:43:47,211 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-15 05:43:47,211 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-15 05:43:47,211 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-15 05:43:47,211 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-15 05:43:47,212 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-15 05:43:47,212 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-15 05:43:47,212 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-15 05:43:47,212 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-15 05:43:47,213 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-15 05:43:47,213 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-15 05:43:47,213 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-15 05:43:47,213 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-15 05:43:47,214 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-15 05:43:47,214 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-15 05:43:47,214 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-15 05:43:47,215 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-15 05:43:47,215 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-15 05:43:47,215 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-15 05:43:47,215 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-15 05:43:47,216 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-15 05:43:47,216 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-15 05:43:47,217 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-15 05:43:47,217 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-15 05:43:47,217 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-15 05:43:47,218 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-15 05:43:47,218 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-15 05:43:47,218 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-15 05:43:47,219 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-15 05:43:47,219 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-15 05:43:47,219 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-15 05:43:47,220 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-15 05:43:47,220 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-15 05:43:47,220 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-15 05:43:47,221 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-15 05:43:47,221 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-15 05:43:47,221 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-15 05:43:47,221 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-15 05:43:47,222 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-15 05:43:47,222 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-15 05:43:47,222 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-15 05:43:47,223 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-15 05:43:47,223 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-15 05:43:47,223 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-15 05:43:47,224 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-15 05:43:47,224 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-15 05:43:47,225 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-15 05:43:47,225 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-15 05:43:47,225 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-15 05:43:47,226 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-15 05:43:47,226 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-15 05:43:47,226 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-15 05:43:47,227 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-15 05:43:47,227 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-15 05:43:47,227 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-15 05:43:47,228 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-15 05:43:47,228 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-15 05:43:47,229 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-15 05:43:47,229 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-15 05:43:47,229 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-15 05:43:47,229 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-15 05:43:47,230 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-15 05:43:47,230 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-15 05:43:47,230 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-15 05:43:47,231 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-15 05:43:47,231 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-15 05:43:47,232 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-15 05:43:47,232 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-15 05:43:47,232 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-15 05:43:47,233 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-15 05:43:47,233 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-15 05:43:47,233 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-15 05:43:47,234 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-15 05:43:47,234 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-15 05:43:47,234 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-15 05:43:47,235 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-15 05:43:47,235 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-15 05:43:47,235 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-15 05:43:47,235 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-15 05:43:47,236 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-15 05:43:47,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {58747#true} ~i~0 := 0; {58747#true} is VALID [2022-04-15 05:43:47,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {58747#true} assume !(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:47,236 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-15 05:43:47,236 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-15 05:43:47,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:47,236 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-15 05:43:47,236 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-15 05:43:47,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:47,236 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-15 05:43:47,236 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-15 05:43:47,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:47,237 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-15 05:43:47,237 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-15 05:43:47,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:47,237 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-15 05:43:47,237 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-15 05:43:47,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-15 05:43:47,237 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-15 05:43:47,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-15 05:43:47,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-15 05:43:47,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-15 05:43:47,237 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-15 05:43:47,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58747#true} is VALID [2022-04-15 05:43:47,238 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-15 05:43:47,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997915137] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:47,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:47,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 30, 30] total 60 [2022-04-15 05:43:47,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:47,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1183933042] [2022-04-15 05:43:47,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1183933042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:47,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:47,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:43:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317352741] [2022-04-15 05:43:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:47,239 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-15 05:43:47,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:47,240 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-15 05:43:47,272 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-15 05:43:47,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:43:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:47,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:43:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=2668, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 05:43:47,273 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-15 05:43:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:50,844 INFO L93 Difference]: Finished difference Result 614 states and 798 transitions. [2022-04-15 05:43:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:43:50,844 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-15 05:43:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:50,844 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-15 05:43:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2022-04-15 05:43:50,846 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-15 05:43:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2022-04-15 05:43:50,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 182 transitions. [2022-04-15 05:43:50,993 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-15 05:43:51,006 INFO L225 Difference]: With dead ends: 614 [2022-04-15 05:43:51,006 INFO L226 Difference]: Without dead ends: 603 [2022-04-15 05:43:51,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2027 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1053, Invalid=3503, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 05:43:51,007 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-15 05:43:51,007 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-15 05:43:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-15 05:43:52,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 373. [2022-04-15 05:43:52,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:52,557 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-15 05:43:52,557 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-15 05:43:52,558 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-15 05:43:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:52,570 INFO L93 Difference]: Finished difference Result 603 states and 786 transitions. [2022-04-15 05:43:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 786 transitions. [2022-04-15 05:43:52,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:52,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:52,571 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-15 05:43:52,572 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-15 05:43:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:52,585 INFO L93 Difference]: Finished difference Result 603 states and 786 transitions. [2022-04-15 05:43:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 786 transitions. [2022-04-15 05:43:52,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:52,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:52,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:52,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:52,586 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-15 05:43:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 482 transitions. [2022-04-15 05:43:52,593 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 482 transitions. Word has length 365 [2022-04-15 05:43:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:52,593 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 482 transitions. [2022-04-15 05:43:52,593 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-15 05:43:52,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 373 states and 482 transitions. [2022-04-15 05:43:53,456 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-15 05:43:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 482 transitions. [2022-04-15 05:43:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2022-04-15 05:43:53,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:53,459 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-15 05:43:53,479 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-15 05:43:53,659 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-15 05:43:53,659 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:53,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash -382120294, now seen corresponding path program 65 times [2022-04-15 05:43:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:53,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517647383] [2022-04-15 05:43:53,664 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:53,664 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:53,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash -382120294, now seen corresponding path program 66 times [2022-04-15 05:43:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:53,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134515691] [2022-04-15 05:43:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:53,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:54,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:54,008 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-15 05:43:54,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-15 05:43:54,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-15 05:43:54,009 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-15 05:43:54,009 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-15 05:43:54,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-15 05:43:54,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-15 05:43:54,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {64195#true} call #t~ret22 := main(); {64195#true} is VALID [2022-04-15 05:43:54,011 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-15 05:43:54,011 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-15 05:43:54,012 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-15 05:43:54,012 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-15 05:43:54,012 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-15 05:43:54,012 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-15 05:43:54,013 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-15 05:43:54,013 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-15 05:43:54,013 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-15 05:43:54,014 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-15 05:43:54,014 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-15 05:43:54,014 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-15 05:43:54,014 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-15 05:43:54,015 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-15 05:43:54,015 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-15 05:43:54,015 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-15 05:43:54,015 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-15 05:43:54,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {64200#(<= 20 main_~edgecount~0)} ~i~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-15 05:43:54,016 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-15 05:43:54,016 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-15 05:43:54,016 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-15 05:43:54,017 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-15 05:43:54,017 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-15 05:43:54,017 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-15 05:43:54,018 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-15 05:43:54,018 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-15 05:43:54,018 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-15 05:43:54,018 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-15 05:43:54,019 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-15 05:43:54,019 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-15 05:43:54,019 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-15 05:43:54,019 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-15 05:43:54,020 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-15 05:43:54,020 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-15 05:43:54,020 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-15 05:43:54,021 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-15 05:43:54,021 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-15 05:43:54,021 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-15 05:43:54,021 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-15 05:43:54,022 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-15 05:43:54,022 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-15 05:43:54,022 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-15 05:43:54,022 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-15 05:43:54,023 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-15 05:43:54,023 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-15 05:43:54,023 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-15 05:43:54,024 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-15 05:43:54,024 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-15 05:43:54,024 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-15 05:43:54,024 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-15 05:43:54,025 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-15 05:43:54,025 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-15 05:43:54,025 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-15 05:43:54,025 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-15 05:43:54,026 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-15 05:43:54,026 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-15 05:43:54,026 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-15 05:43:54,026 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-15 05:43:54,027 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-15 05:43:54,027 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-15 05:43:54,027 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-15 05:43:54,028 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-15 05:43:54,028 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-15 05:43:54,028 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-15 05:43:54,028 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-15 05:43:54,029 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-15 05:43:54,029 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-15 05:43:54,029 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-15 05:43:54,029 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-15 05:43:54,030 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-15 05:43:54,030 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-15 05:43:54,030 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-15 05:43:54,031 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-15 05:43:54,031 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-15 05:43:54,031 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-15 05:43:54,031 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-15 05:43:54,032 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-15 05:43:54,032 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-15 05:43:54,032 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-15 05:43:54,033 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-15 05:43:54,033 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-15 05:43:54,033 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-15 05:43:54,033 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-15 05:43:54,034 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-15 05:43:54,034 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-15 05:43:54,034 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-15 05:43:54,034 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-15 05:43:54,035 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-15 05:43:54,035 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-15 05:43:54,035 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-15 05:43:54,035 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-15 05:43:54,036 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-15 05:43:54,036 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-15 05:43:54,036 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-15 05:43:54,037 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-15 05:43:54,037 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-15 05:43:54,037 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-15 05:43:54,037 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-15 05:43:54,038 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-15 05:43:54,038 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-15 05:43:54,038 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-15 05:43:54,038 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-15 05:43:54,039 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-15 05:43:54,039 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-15 05:43:54,039 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-15 05:43:54,040 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-15 05:43:54,040 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-15 05:43:54,040 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-15 05:43:54,040 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-15 05:43:54,041 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-15 05:43:54,041 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-15 05:43:54,041 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-15 05:43:54,041 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-15 05:43:54,042 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-15 05:43:54,042 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-15 05:43:54,042 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-15 05:43:54,042 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-15 05:43:54,043 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-15 05:43:54,043 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-15 05:43:54,043 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-15 05:43:54,044 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-15 05:43:54,044 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-15 05:43:54,044 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-15 05:43:54,044 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-15 05:43:54,045 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-15 05:43:54,045 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-15 05:43:54,045 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-15 05:43:54,045 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-15 05:43:54,046 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-15 05:43:54,046 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-15 05:43:54,046 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-15 05:43:54,047 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-15 05:43:54,047 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-15 05:43:54,047 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-15 05:43:54,047 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-15 05:43:54,048 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-15 05:43:54,048 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-15 05:43:54,048 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-15 05:43:54,048 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-15 05:43:54,049 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-15 05:43:54,049 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-15 05:43:54,049 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-15 05:43:54,049 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-15 05:43:54,050 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-15 05:43:54,050 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-15 05:43:54,050 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-15 05:43:54,051 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-15 05:43:54,051 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-15 05:43:54,051 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-15 05:43:54,051 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-15 05:43:54,052 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-15 05:43:54,052 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-15 05:43:54,052 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-15 05:43:54,052 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-15 05:43:54,053 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-15 05:43:54,053 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-15 05:43:54,053 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-15 05:43:54,054 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-15 05:43:54,054 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-15 05:43:54,054 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-15 05:43:54,054 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-15 05:43:54,055 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-15 05:43:54,055 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-15 05:43:54,055 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-15 05:43:54,055 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-15 05:43:54,056 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-15 05:43:54,056 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-15 05:43:54,056 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-15 05:43:54,057 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-15 05:43:54,057 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-15 05:43:54,057 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-15 05:43:54,057 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-15 05:43:54,058 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-15 05:43:54,058 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-15 05:43:54,058 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-15 05:43:54,058 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-15 05:43:54,059 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-15 05:43:54,059 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-15 05:43:54,059 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-15 05:43:54,059 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-15 05:43:54,060 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-15 05:43:54,060 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-15 05:43:54,060 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-15 05:43:54,061 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-15 05:43:54,061 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-15 05:43:54,061 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-15 05:43:54,061 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-15 05:43:54,062 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-15 05:43:54,062 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-15 05:43:54,062 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-15 05:43:54,062 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-15 05:43:54,063 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-15 05:43:54,063 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-15 05:43:54,063 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-15 05:43:54,064 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-15 05:43:54,064 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-15 05:43:54,064 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-15 05:43:54,064 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-15 05:43:54,065 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-15 05:43:54,065 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-15 05:43:54,065 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-15 05:43:54,065 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-15 05:43:54,066 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-15 05:43:54,066 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-15 05:43:54,066 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-15 05:43:54,067 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-15 05:43:54,067 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-15 05:43:54,067 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-15 05:43:54,067 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-15 05:43:54,068 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-15 05:43:54,068 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-15 05:43:54,068 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-15 05:43:54,068 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-15 05:43:54,069 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-15 05:43:54,069 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-15 05:43:54,069 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-15 05:43:54,070 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-15 05:43:54,070 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-15 05:43:54,070 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-15 05:43:54,070 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-15 05:43:54,071 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-15 05:43:54,071 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-15 05:43:54,071 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-15 05:43:54,071 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-15 05:43:54,072 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-15 05:43:54,072 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-15 05:43:54,072 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-15 05:43:54,072 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-15 05:43:54,073 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-15 05:43:54,073 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-15 05:43:54,073 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-15 05:43:54,074 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-15 05:43:54,074 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-15 05:43:54,074 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-15 05:43:54,074 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-15 05:43:54,075 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-15 05:43:54,075 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-15 05:43:54,075 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-15 05:43:54,075 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-15 05:43:54,076 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-15 05:43:54,076 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-15 05:43:54,076 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-15 05:43:54,077 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-15 05:43:54,077 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-15 05:43:54,077 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-15 05:43:54,077 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-15 05:43:54,078 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-15 05:43:54,078 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-15 05:43:54,078 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-15 05:43:54,078 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-15 05:43:54,079 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-15 05:43:54,079 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-15 05:43:54,079 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-15 05:43:54,079 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-15 05:43:54,080 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-15 05:43:54,080 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-15 05:43:54,080 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-15 05:43:54,081 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-15 05:43:54,081 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-15 05:43:54,081 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-15 05:43:54,081 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-15 05:43:54,082 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-15 05:43:54,082 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-15 05:43:54,082 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-15 05:43:54,082 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-15 05:43:54,083 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-15 05:43:54,083 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-15 05:43:54,083 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-15 05:43:54,084 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-15 05:43:54,084 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-15 05:43:54,084 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-15 05:43:54,084 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-15 05:43:54,085 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-15 05:43:54,085 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-15 05:43:54,085 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-15 05:43:54,085 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-15 05:43:54,086 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-15 05:43:54,086 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-15 05:43:54,086 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-15 05:43:54,086 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-15 05:43:54,087 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-15 05:43:54,087 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-15 05:43:54,087 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-15 05:43:54,088 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-15 05:43:54,088 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-15 05:43:54,088 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-15 05:43:54,088 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-15 05:43:54,089 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-15 05:43:54,089 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-15 05:43:54,089 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-15 05:43:54,089 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-15 05:43:54,090 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-15 05:43:54,090 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-15 05:43:54,090 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-15 05:43:54,091 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-15 05:43:54,091 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-15 05:43:54,091 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-15 05:43:54,091 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-15 05:43:54,092 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-15 05:43:54,092 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-15 05:43:54,092 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-15 05:43:54,092 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-15 05:43:54,093 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-15 05:43:54,093 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-15 05:43:54,093 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-15 05:43:54,093 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-15 05:43:54,094 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-15 05:43:54,094 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-15 05:43:54,094 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-15 05:43:54,094 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-15 05:43:54,095 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-15 05:43:54,095 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-15 05:43:54,095 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-15 05:43:54,096 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-15 05:43:54,096 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-15 05:43:54,096 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-15 05:43:54,096 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-15 05:43:54,097 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-15 05:43:54,097 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-15 05:43:54,097 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-15 05:43:54,097 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-15 05:43:54,098 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-15 05:43:54,098 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-15 05:43:54,098 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-15 05:43:54,098 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-15 05:43:54,099 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-15 05:43:54,099 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-15 05:43:54,099 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-15 05:43:54,100 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-15 05:43:54,100 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-15 05:43:54,100 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-15 05:43:54,100 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-15 05:43:54,101 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-15 05:43:54,101 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-15 05:43:54,101 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-15 05:43:54,102 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-15 05:43:54,102 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-15 05:43:54,103 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-15 05:43:54,103 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-15 05:43:54,103 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-15 05:43:54,104 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-15 05:43:54,104 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-15 05:43:54,104 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-15 05:43:54,105 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-15 05:43:54,105 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-15 05:43:54,105 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-15 05:43:54,106 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-15 05:43:54,106 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-15 05:43:54,106 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-15 05:43:54,107 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-15 05:43:54,107 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-15 05:43:54,107 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-15 05:43:54,107 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-15 05:43:54,108 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-15 05:43:54,108 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-15 05:43:54,108 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-15 05:43:54,109 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-15 05:43:54,109 INFO L290 TraceCheckUtils]: 362: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-15 05:43:54,109 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-15 05:43:54,109 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-15 05:43:54,109 INFO L290 TraceCheckUtils]: 365: Hoare triple {64196#false} ~cond := #in~cond; {64196#false} is VALID [2022-04-15 05:43:54,109 INFO L290 TraceCheckUtils]: 366: Hoare triple {64196#false} assume 0 == ~cond; {64196#false} is VALID [2022-04-15 05:43:54,109 INFO L290 TraceCheckUtils]: 367: Hoare triple {64196#false} assume !false; {64196#false} is VALID [2022-04-15 05:43:54,110 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-15 05:43:54,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:54,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134515691] [2022-04-15 05:43:54,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134515691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:54,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458954536] [2022-04-15 05:43:54,110 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:43:54,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:54,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:54,111 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-15 05:43:54,112 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-15 05:44:05,756 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 05:44:05,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:44:05,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-15 05:44:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:05,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:44:05,967 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-15 05:44:06,129 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-15 05:44:06,129 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-15 05:44:06,327 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-15 05:44:06,328 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-15 05:44:06,471 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-15 05:44:06,472 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-15 05:44:06,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:44:06,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:44:06,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:44:06,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:44:06,629 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-15 05:44:06,629 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-15 05:44:07,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:44:07,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:44:07,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:44:07,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:44:07,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:44:07,056 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-15 05:44:07,056 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-15 05:44:08,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:44:08,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:44:08,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:44:08,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:44:08,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:44:08,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:44:08,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:44:08,187 INFO L356 Elim1Store]: treesize reduction 99, result has 19.5 percent of original size [2022-04-15 05:44:08,187 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-15 05:44:09,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:44:09,105 INFO L356 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2022-04-15 05:44:09,106 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-15 05:44:10,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {64195#true} call ULTIMATE.init(); {64195#true} is VALID [2022-04-15 05:44:10,012 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-15 05:44:10,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-15 05:44:10,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-15 05:44:10,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {64195#true} call #t~ret22 := main(); {64195#true} is VALID [2022-04-15 05:44:10,024 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-15 05:44:10,025 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-15 05:44:10,026 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-15 05:44:10,028 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-15 05:44:10,028 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-15 05:44:10,029 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-15 05:44:10,030 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-15 05:44:10,031 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-15 05:44:10,032 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-15 05:44:10,032 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-15 05:44:10,033 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-15 05:44:10,034 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-15 05:44:10,035 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-15 05:44:10,036 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-15 05:44:10,037 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-15 05:44:10,038 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-15 05:44:10,039 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-15 05:44:10,040 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-15 05:44:10,046 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-15 05:44:10,047 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-15 05:44:10,050 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-15 05:44:10,051 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-15 05:44:10,052 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-15 05:44:10,052 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,053 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,054 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,055 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-15 05:44:10,056 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-15 05:44:10,056 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-15 05:44:10,056 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-15 05:44:10,056 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-15 05:44:10,056 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-15 05:44:10,056 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-15 05:44:10,056 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-15 05:44:10,056 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-15 05:44:10,056 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-15 05:44:10,056 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-15 05:44:10,056 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-15 05:44:10,056 INFO L290 TraceCheckUtils]: 84: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-15 05:44:10,056 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-15 05:44:10,056 INFO L290 TraceCheckUtils]: 86: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-15 05:44:10,056 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,057 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,058 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,059 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 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-15 05:44:10,060 INFO L290 TraceCheckUtils]: 147: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-15 05:44:10,060 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-15 05:44:10,061 INFO L290 TraceCheckUtils]: 149: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,061 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,062 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,063 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,064 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-15 05:44:10,065 INFO L290 TraceCheckUtils]: 210: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-15 05:44:10,065 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-15 05:44:10,065 INFO L290 TraceCheckUtils]: 212: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,065 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,066 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,067 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,068 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-15 05:44:10,069 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-15 05:44:10,069 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-15 05:44:10,069 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-15 05:44:10,069 INFO L290 TraceCheckUtils]: 273: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-15 05:44:10,069 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-15 05:44:10,069 INFO L290 TraceCheckUtils]: 275: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-15 05:44:10,069 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-15 05:44:10,069 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-15 05:44:10,069 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-15 05:44:10,069 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-15 05:44:10,069 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-15 05:44:10,069 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-15 05:44:10,069 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-15 05:44:10,069 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-15 05:44:10,069 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,070 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,071 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,072 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-15 05:44:10,073 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-15 05:44:10,073 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-15 05:44:10,073 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-15 05:44:10,073 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-15 05:44:10,073 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-15 05:44:10,073 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-15 05:44:10,073 INFO L290 TraceCheckUtils]: 336: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-15 05:44:10,073 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-15 05:44:10,073 INFO L290 TraceCheckUtils]: 338: Hoare triple {64196#false} assume !(~i~0 < ~nodecount~0); {64196#false} is VALID [2022-04-15 05:44:10,073 INFO L290 TraceCheckUtils]: 339: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-15 05:44:10,073 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-15 05:44:10,073 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-15 05:44:10,073 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-15 05:44:10,073 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-15 05:44:10,073 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,074 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-15 05:44:10,075 INFO L290 TraceCheckUtils]: 361: Hoare triple {64196#false} assume !(~i~0 < ~edgecount~0); {64196#false} is VALID [2022-04-15 05:44:10,075 INFO L290 TraceCheckUtils]: 362: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-15 05:44:10,075 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-15 05:44:10,075 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-15 05:44:10,075 INFO L290 TraceCheckUtils]: 365: Hoare triple {64196#false} ~cond := #in~cond; {64196#false} is VALID [2022-04-15 05:44:10,075 INFO L290 TraceCheckUtils]: 366: Hoare triple {64196#false} assume 0 == ~cond; {64196#false} is VALID [2022-04-15 05:44:10,075 INFO L290 TraceCheckUtils]: 367: Hoare triple {64196#false} assume !false; {64196#false} is VALID [2022-04-15 05:44:10,076 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-15 05:44:10,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:44:15,019 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-15 05:44:16,105 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-15 05:44:33,911 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-15 05:44:41,912 INFO L356 Elim1Store]: treesize reduction 414, result has 23.8 percent of original size [2022-04-15 05:44:41,913 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